Recognised as Number

3,462,001

Positive
Odd
Composite
7 digits

3,462,001 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 value3,462,001

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation337 × 10,273

Distinct prime factors2337, 10,273

Number of divisors4

Sum of divisors σ(n)3,472,612

Aliquot sum10,611sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,451,392integers below n that share no factor with it

Carmichael function λ(n)71,904the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,451,392

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 337, 10,273, 3,462,0014 in total

Arithmetic

Previous number3,462,000

Next number3,462,002

Double6,924,002

Half1,731,000.5

Square11,985,450,924,001

Cube41,493,643,084,342,386,001

Square root1,860.645318162≈irrational, shown to 9 decimal places

Cube root151.277984486≈

Negation-3,462,001

Reciprocal2.88850292 × 10^-7≈

Representations

Decimal3,462,001

Binary110100110100110111000122 bits

Octal15151561

Hexadecimal34D371

Base 36227AP

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, four hundred and sixty-two thousand and one

Ordinalthree million, four hundred and sixty-two thousand and first

Scientific notation3.462001 × 10^6

Engineering notation3.462001 × 10^6

In other bases

Ternary20111212222021base 3; the most digit-efficient integer base after e: 14 digits

Quinary1341241001base 5; one hand: 10 digits

Septenary41266204base 7: 8 digits

Nonary6455867base 9; each digit is two ternary digits: 7 digits

Duodecimal11ab581base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal11cf01base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal16:1:40:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T1TTT0T000T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11101011101010010110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101001101001101110001

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

Bytes334 d3 71

Gray code1011101011101011001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101001101001101110001

64-bit0000000000000000000000000000000000000000001101001101001101110001

One's complement11111111110010110010110010001110at 32 bits, every bit flipped

Bits reversed10001110110010110010110000000000at 32 bits

Rotated left by 100000000011010011010011011100010at 32 bits, wrapping

Shifted left by 111010011010011011100010= 6,924,002, no wrap

Shifted right by 1110100110100110111000= 1,731,000, discarding the low bit

These bits as a double1.71045576 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,462,023+22

Previous prime3,461,993−8

Distance to nearest prime8

Nearest square below3,459,600

Nearest square above3,463,321

Powers & multiples

3,462,001 to the power 211,985,450,924,001

3,462,001 to the power 341,493,643,084,342,386,001

3,462,001 to the power 4143,651,033,851,636,424,677,848,001

3,462,001 to the power 5497,320,022,845,399,153,871,134,457,310,001

First ten multiples3,462,001, 6,924,002, 10,386,003, 13,848,004, 17,310,005, 20,772,006, 24,234,007, 27,696,008, 31,158,009, 34,620,010

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time

Highest value reached10,386,0043× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,462,001 → 10,386,004 → 5,193,002 → 2,596,501 → 7,789,504 → 3,894,752 → 1,947,376 → 973,688 → 486,844 → 243,422 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage346,200,100%

3,462,001% as a decimal34,620.01

3,462,001% of 1003,462,001

3,462,001% of 1,00034,620,010

As a fraction of 1003,462,001/100

Read another way

As seconds40 days, 1 hour and 40 minutes

As bytes3.302 MiB

As a 24-bit colour#34D371

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.