Recognised as Number
6,772,013
- Positive
- Odd
- Prime
- 7 digits
6,772,013 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,772,013
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,772,013
Distinct prime factors16,772,013
Number of divisors2
Sum of divisors σ(n)6,772,014
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,772,012integers below n that share no factor with it
Carmichael function λ(n)6,772,012the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 6,772,0132 in total
Arithmetic
Previous number6,772,012
Next number6,772,014
Double13,544,026
Half3,386,006.5
Square45,860,160,072,169
Cube310,565,600,190,809,406,197
Square root2,602.309166875≈irrational, shown to 9 decimal places
Cube root189.193376353≈
Negation-6,772,013
Reciprocal1.4766658 × 10^-7≈
Representations
Decimal6,772,013
Binary1100111010101010010110123 bits
Octal31652455
Hexadecimal67552D
Base 36415BH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and seventy-two thousand and thirteen
Ordinalsix million, seven hundred and seventy-two thousand and thirteenth
Scientific notation6.772013 × 10^6
Engineering notation6.772013 × 10^6
In other bases
Ternary110202001110022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3213201023base 5; one hand: 10 digits
Septenary111363323base 7: 9 digits
Nonary13661408base 9; each digit is two ternary digits: 8 digits
Duodecimal2326ba5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal226a0dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:21:6:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T1T00111010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110110101010101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001110101010100101101
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes367 55 2d
Gray code10101001111111110111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001110101010100101101
64-bit0000000000000000000000000000000000000000011001110101010100101101
One's complement11111111100110001010101011010010at 32 bits, every bit flipped
Bits reversed10110100101010101110011000000000at 32 bits
Rotated left by 100000000110011101010101001011010at 32 bits, wrapping
Shifted left by 1110011101010101001011010= 13,544,026, no wrap
Shifted right by 11100111010101010010110= 3,386,006, discarding the low bit
These bits as a double3.34581898 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,772,013 to the power 245,860,160,072,169
6,772,013 to the power 3310,565,600,190,809,406,197
6,772,013 to the power 42,103,154,281,844,963,779,288,364,561
6,772,013 to the power 514,242,588,137,659,758,697,869,935,555,831,293
First ten multiples6,772,013, 13,544,026, 20,316,039, 27,088,052, 33,860,065, 40,632,078, 47,404,091, 54,176,104, 60,948,117, 67,720,130
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached20,316,0403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,772,013 → 20,316,040 → 10,158,020 → 5,079,010 → 2,539,505 → 7,618,516 → 3,809,258 → 1,904,629 → 5,713,888 → 2,856,944 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage677,201,300%
6,772,013% as a decimal67,720.13
6,772,013% of 1006,772,013
6,772,013% of 1,00067,720,130
As a fraction of 1006,772,013/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 6,772,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page