Recognised as Number
2,431,483
- Positive
- Odd
- Composite
- 7 digits
2,431,483 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,431,483
Digit count7
Digit sum25
Digit product2,304
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation349 × 6,967
Distinct prime factors2349, 6,967
Number of divisors4
Sum of divisors σ(n)2,438,800
Aliquot sum7,317sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,424,168integers below n that share no factor with it
Carmichael function λ(n)404,028the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,424,168
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 349, 6,967, 2,431,4834 in total
Arithmetic
Previous number2,431,482
Next number2,431,484
Double4,862,966
Half1,215,741.5
Square5,912,109,579,289
Cube14,375,193,936,178,355,587
Square root1,559.321326732≈irrational, shown to 9 decimal places
Cube root134.469486313≈
Negation-2,431,483
Reciprocal4.1127164 × 10^-7≈
Representations
Decimal2,431,483
Binary100101000110011111101122 bits
Octal11214773
Hexadecimal2519FB
Base 361G457
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and thirty-one thousand, four hundred and eighty-three
Ordinaltwo million, four hundred and thirty-one thousand, four hundred and eighty-third
Scientific notation2.431483 × 10^6
Engineering notation2.431483 × 10^6
In other bases
Ternary11120112100221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1110301413base 5; one hand: 10 digits
Septenary26444605base 7: 8 digits
Nonary4515327base 9; each digit is two ternary digits: 7 digits
Duodecimal993137base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf3ie3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:15:24:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT1TTT1010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010110111000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010001100111111011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes325 19 fb
Gray code1101111001010100000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010001100111111011
64-bit0000000000000000000000000000000000000000001001010001100111111011
One's complement11111111110110101110011000000100at 32 bits, every bit flipped
Bits reversed11011111100110001010010000000000at 32 bits
Rotated left by 100000000010010100011001111110110at 32 bits, wrapping
Shifted left by 110010100011001111110110= 4,862,966, no wrap
Shifted right by 1100101000110011111101= 1,215,741, discarding the low bit
These bits as a double1.20131222 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,431,483 to the power 25,912,109,579,289
2,431,483 to the power 314,375,193,936,178,355,587
2,431,483 to the power 434,953,039,677,520,756,577,745,521
2,431,483 to the power 584,987,721,774,217,201,765,926,412,637,643
First ten multiples2,431,483, 4,862,966, 7,294,449, 9,725,932, 12,157,415, 14,588,898, 17,020,381, 19,451,864, 21,883,347, 24,314,830
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached13,848,0645× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,431,483 → 7,294,450 → 3,647,225 → 10,941,676 → 5,470,838 → 2,735,419 → 8,206,258 → 4,103,129 → 12,309,388 → 6,154,694 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage243,148,300%
2,431,483% as a decimal24,314.83
2,431,483% of 1002,431,483
2,431,483% of 1,00024,314,830
As a fraction of 1002,431,483/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,431,483
Nerdulate something else
Nothing in mind? Surprise me · today’s page