Recognised as Number
3,154,121
- Positive
- Odd
- Composite
- 7 digits
3,154,121 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,154,121
Digit count7
Digit sum17
Digit product120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation233 × 13,537
Distinct prime factors2233, 13,537
Number of divisors4
Sum of divisors σ(n)3,167,892
Aliquot sum13,771sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,140,352integers below n that share no factor with it
Carmichael function λ(n)392,544the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,140,352
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 233, 13,537, 3,154,1214 in total
Arithmetic
Previous number3,154,120
Next number3,154,122
Double6,308,242
Half1,577,060.5
Square9,948,479,282,641
Cube31,378,707,423,442,913,561
Square root1,775.984515698≈irrational, shown to 9 decimal places
Cube root146.653618559≈
Negation-3,154,121
Reciprocal3.17045541 × 10^-7≈
Representations
Decimal3,154,121
Binary110000001000001100100122 bits
Octal14020311
Hexadecimal3020C9
Base 361VLQH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and fifty-four thousand, one hundred and twenty-one
Ordinalthree million, one hundred and fifty-four thousand, one hundred and twenty-first
Scientific notation3.154121 × 10^6
Engineering notation3.154121 × 10^6
In other bases
Ternary12221020122022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1301412441base 5; one hand: 10 digits
Septenary35544455base 7: 8 digits
Nonary5836568base 9; each digit is two ternary digits: 7 digits
Duodecimal1081375base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalje561base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:36:8:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T11T1T0T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100000110000111011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000010000011001001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes330 20 c9
Gray code1010000011000010101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000010000011001001
64-bit0000000000000000000000000000000000000000001100000010000011001001
One's complement11111111110011111101111100110110at 32 bits, every bit flipped
Bits reversed10010011000001000000110000000000at 32 bits
Rotated left by 100000000011000000100000110010010at 32 bits, wrapping
Shifted left by 111000000100000110010010= 6,308,242, no wrap
Shifted right by 1110000001000001100100= 1,577,060, discarding the low bit
These bits as a double1.55834283 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,154,121 to the power 29,948,479,282,641
3,154,121 to the power 331,378,707,423,442,913,561
3,154,121 to the power 498,972,240,037,137,185,963,934,881
3,154,121 to the power 5312,170,420,718,175,178,129,752,250,794,601
First ten multiples3,154,121, 6,308,242, 9,462,363, 12,616,484, 15,770,605, 18,924,726, 22,078,847, 25,232,968, 28,387,089, 31,541,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached15,967,7445× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,154,121 → 9,462,364 → 4,731,182 → 2,365,591 → 7,096,774 → 3,548,387 → 10,645,162 → 5,322,581 → 15,967,744 → 7,983,872 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage315,412,100%
3,154,121% as a decimal31,541.21
3,154,121% of 1003,154,121
3,154,121% of 1,00031,541,210
As a fraction of 1003,154,121/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,154,121
Nerdulate something else
Nothing in mind? Surprise me · today’s page