Recognised as Number
2,012,629
- Positive
- Odd
- Composite
- 7 digits
2,012,629 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,012,629
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation29 × 69,401
Distinct prime factors229, 69,401
Number of divisors4
Sum of divisors σ(n)2,082,060
Aliquot sum69,431sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,943,200integers below n that share no factor with it
Carmichael function λ(n)485,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,943,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 69,401, 2,012,6294 in total
Arithmetic
Previous number2,012,628
Next number2,012,630
Double4,025,258
Half1,006,314.5
Square4,050,675,491,641
Cube8,152,506,964,065,934,189
Square root1,418.671561708≈irrational, shown to 9 decimal places
Cube root126.256741136≈
Negation-2,012,629
Reciprocal4.96862561 × 10^-7≈
Representations
Decimal2,012,629
Binary11110101101011101010121 bits
Octal7532725
Hexadecimal1EB5D5
Base 36174YD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, twelve thousand, six hundred and twenty-nine
Ordinaltwo million, twelve thousand, six hundred and twenty-ninth
Scientific notation2.012629 × 10^6
Engineering notation2.012629 × 10^6
In other bases
Ternary10210020210211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003401004base 5; one hand: 10 digits
Septenary23051503base 7: 8 digits
Nonary3706724base 9; each digit is two ternary digits: 7 digits
Duodecimal810871base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbbb9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:3:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T101T1T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100101011010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101011010111010101
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31e b5 d5
Gray code100011110111100111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101011010111010101
64-bit0000000000000000000000000000000000000000000111101011010111010101
One's complement11111111111000010100101000101010at 32 bits, every bit flipped
Bits reversed10101011101011010111100000000000at 32 bits
Rotated left by 100000000001111010110101110101010at 32 bits, wrapping
Shifted left by 11111010110101110101010= 4,025,258, no wrap
Shifted right by 111110101101011101010= 1,006,314, discarding the low bit
These bits as a double9.94370847 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,012,629 to the power 24,050,675,491,641
2,012,629 to the power 38,152,506,964,065,934,189
2,012,629 to the power 416,407,971,938,581,057,060,872,881
2,012,629 to the power 533,023,160,154,774,454,291,367,525,614,149
First ten multiples2,012,629, 4,025,258, 6,037,887, 8,050,516, 10,063,145, 12,075,774, 14,088,403, 16,101,032, 18,113,661, 20,126,290
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached6,037,8883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,012,629 → 6,037,888 → 3,018,944 → 1,509,472 → 754,736 → 377,368 → 188,684 → 94,342 → 47,171 → 141,514 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,262,900%
2,012,629% as a decimal20,126.29
2,012,629% of 1002,012,629
2,012,629% of 1,00020,126,290
As a fraction of 1002,012,629/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 2,012,629
Nerdulate something else
Nothing in mind? Surprise me · today’s page