Recognised as Number
2,474,883
- Positive
- Odd
- Composite
- 7 digits
2,474,883 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,474,883
Digit count7
Digit sum36
Digit product43,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 19 × 41 × 353
Distinct prime factors43, 19, 41, 353
Number of divisors24
Sum of divisors σ(n)3,865,680
Aliquot sum1,390,797sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,520,640integers below n that share no factor with it
Carmichael function λ(n)15,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,520,640
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 19, 41, 57, 123, 171, 353, 369, 779, 1,059, 2,337, 3,177, 6,707, 7,011, 14,473, 20,121, 43,419, 60,363, 130,257, 274,987, 824,961, 2,474,88324 in total
Arithmetic
Previous number2,474,882
Next number2,474,884
Double4,949,766
Half1,237,441.5
Square6,125,045,863,689
Cube15,158,771,882,264,223,387
Square root1,573.176086775≈irrational, shown to 9 decimal places
Cube root135.264829937≈
Negation-2,474,883
Reciprocal4.04059505 × 10^-7≈
Representations
Decimal2,474,883
Binary100101110000111000001122 bits
Octal11341603
Hexadecimal25C383
Base 361H1MR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and seventy-four thousand, eight hundred and eighty-three
Ordinaltwo million, four hundred and seventy-four thousand, eight hundred and eighty-third
Scientific notation2.474883 × 10^6
Engineering notation2.474883 × 10^6
In other bases
Ternary11122201220100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1113144013base 5; one hand: 10 digits
Septenary30015255base 7: 8 digits
Nonary4581810base 9; each digit is two ternary digits: 7 digits
Duodecimal9b4283base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf9743base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:27:28:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT00T1T0T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101100010010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001011100001110000011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; 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 c3 83
Gray code1101110010001001000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001011100001110000011
64-bit0000000000000000000000000000000000000000001001011100001110000011
One's complement11111111110110100011110001111100at 32 bits, every bit flipped
Bits reversed11000001110000111010010000000000at 32 bits
Rotated left by 100000000010010111000011100000110at 32 bits, wrapping
Shifted left by 110010111000011100000110= 4,949,766, no wrap
Shifted right by 1100101110000111000001= 1,237,441, discarding the low bit
These bits as a double1.22275467 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,474,883 to the power 26,125,045,863,689
2,474,883 to the power 315,158,771,882,264,223,387
2,474,883 to the power 437,516,186,832,293,727,968,688,721
2,474,883 to the power 592,848,173,016,067,598,356,332,247,894,643
First ten multiples2,474,883, 4,949,766, 7,424,649, 9,899,532, 12,374,415, 14,849,298, 17,324,181, 19,799,064, 22,273,947, 24,748,830
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1174the total stopping time
Highest value reached11,136,9764× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,474,883 → 7,424,650 → 3,712,325 → 11,136,976 → 5,568,488 → 2,784,244 → 1,392,122 → 696,061 → 2,088,184 → 1,044,092 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage247,488,300%
2,474,883% as a decimal24,748.83
2,474,883% of 1002,474,883
2,474,883% of 1,00024,748,830
As a fraction of 1002,474,883/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,474,883
Nerdulate something else
Nothing in mind? Surprise me · today’s page