Recognised as Number
3,512,423
- Positive
- Odd
- Composite
- 7 digits
3,512,423 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,512,423
Digit count7
Digit sum20
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation947 × 3,709
Distinct prime factors2947, 3,709
Number of divisors4
Sum of divisors σ(n)3,517,080
Aliquot sum4,657sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,507,768integers below n that share no factor with it
Carmichael function λ(n)1,753,884the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,507,768
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 947, 3,709, 3,512,4234 in total
Arithmetic
Previous number3,512,422
Next number3,512,424
Double7,024,846
Half1,756,211.5
Square12,337,115,330,929
Cube43,333,167,642,007,630,967
Square root1,874.145938821≈irrational, shown to 9 decimal places
Cube root152.008872405≈
Negation-3,512,423
Reciprocal2.8470375 × 10^-7≈
Representations
Decimal3,512,423
Binary110101100110000110011122 bits
Octal15314147
Hexadecimal359867
Base 3623A7B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and twelve thousand, four hundred and twenty-three
Ordinalthree million, five hundred and twelve thousand, four hundred and twenty-third
Scientific notation3.512423 × 10^6
Engineering notation3.512423 × 10^6
In other bases
Ternary20121110010202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344344143base 5; one hand: 10 digits
Septenary41566205base 7: 8 digits
Nonary6543122base 9; each digit is two ternary digits: 7 digits
Duodecimal121479bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11j113base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:40:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1110011T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101110100110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011001100001100111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes335 98 67
Gray code1011110101010001010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011001100001100111
64-bit0000000000000000000000000000000000000000001101011001100001100111
One's complement11111111110010100110011110011000at 32 bits, every bit flipped
Bits reversed11100110000110011010110000000000at 32 bits
Rotated left by 100000000011010110011000011001110at 32 bits, wrapping
Shifted left by 111010110011000011001110= 7,024,846, no wrap
Shifted right by 1110101100110000110011= 1,756,211, discarding the low bit
These bits as a double1.73536754 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,512,423 to the power 212,337,115,330,929
3,512,423 to the power 343,333,167,642,007,630,967
3,512,423 to the power 4152,204,414,688,643,369,184,003,041
3,512,423 to the power 5534,606,286,853,928,808,719,383,513,278,343
First ten multiples3,512,423, 7,024,846, 10,537,269, 14,049,692, 17,562,115, 21,074,538, 24,586,961, 28,099,384, 31,611,807, 35,124,230
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached243,327,40069× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,512,423 → 10,537,270 → 5,268,635 → 15,805,906 → 7,902,953 → 23,708,860 → 11,854,430 → 5,927,215 → 17,781,646 → 8,890,823 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage351,242,300%
3,512,423% as a decimal35,124.23
3,512,423% of 1003,512,423
3,512,423% of 1,00035,124,230
As a fraction of 1003,512,423/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 3,512,423
Nerdulate something else
Nothing in mind? Surprise me · today’s page