Recognised as Number
2,012,631
- Positive
- Odd
- Composite
- 7 digits
2,012,631 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,012,631
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 670,877
Distinct prime factors23, 670,877
Number of divisors4
Sum of divisors σ(n)2,683,512
Aliquot sum670,881sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,341,752integers below n that share no factor with it
Carmichael function λ(n)670,876the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,341,752
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 670,877, 2,012,6314 in total
Arithmetic
Previous number2,012,630
Next number2,012,632
Double4,025,262
Half1,006,315.5
Square4,050,683,542,161
Cube8,152,531,268,143,035,591
Square root1,418.672266593≈irrational, shown to 9 decimal places
Cube root126.256782957≈
Negation-2,012,631
Reciprocal4.96862068 × 10^-7≈
Representations
Decimal2,012,631
Binary11110101101011101011121 bits
Octal7532727
Hexadecimal1EB5D7
Base 36174YF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, twelve thousand, six hundred and thirty-one
Ordinaltwo million, twelve thousand, six hundred and thirty-first
Scientific notation2.012631 × 10^6
Engineering notation2.012631 × 10^6
In other bases
Ternary10210020210220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003401011base 5; one hand: 10 digits
Septenary23051505base 7: 8 digits
Nonary3706726base 9; each digit is two ternary digits: 7 digits
Duodecimal810873base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbbbbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:3:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T101T1T110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100101000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101011010111010111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 set bits, so odd; 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 d7
Gray code100011110111100111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101011010111010111
64-bit0000000000000000000000000000000000000000000111101011010111010111
One's complement11111111111000010100101000101000at 32 bits, every bit flipped
Bits reversed11101011101011010111100000000000at 32 bits
Rotated left by 100000000001111010110101110101110at 32 bits, wrapping
Shifted left by 11111010110101110101110= 4,025,262, no wrap
Shifted right by 111110101101011101011= 1,006,315, discarding the low bit
These bits as a double9.94371835 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,012,631 to the power 24,050,683,542,161
2,012,631 to the power 38,152,531,268,143,035,591
2,012,631 to the power 416,408,037,158,733,985,864,549,921
2,012,631 to the power 533,023,324,234,819,940,704,554,972,052,151
First ten multiples2,012,631, 4,025,262, 6,037,893, 8,050,524, 10,063,155, 12,075,786, 14,088,417, 16,101,048, 18,113,679, 20,126,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached13,585,2646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,012,631 → 6,037,894 → 3,018,947 → 9,056,842 → 4,528,421 → 13,585,264 → 6,792,632 → 3,396,316 → 1,698,158 → 849,079 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,263,100%
2,012,631% as a decimal20,126.31
2,012,631% of 1002,012,631
2,012,631% of 1,00020,126,310
As a fraction of 1002,012,631/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,631
Nerdulate something else
Nothing in mind? Surprise me · today’s page