Recognised as Number

3,482,461

Positive
Odd
Prime
7 digits

3,482,461 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value3,482,461

Digit count7

Digit sum28

Digit product4,608

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,482,461

Distinct prime factors13,482,461

Number of divisors2

Sum of divisors σ(n)3,482,462

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,482,460the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3,482,4612 in total

Arithmetic

Previous number3,482,460

Next number3,482,462

Double6,964,922

Half1,741,230.5

Square12,127,534,616,521

Cube42,233,666,328,184,338,181

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

Cube root151.575410761≈

Negation-3,482,461

Reciprocal2.87153252 × 10^-7≈

Representations

Decimal3,482,461

Binary110101001000110101110122 bits

Octal15221535

Hexadecimal35235D

Base 3622N31

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

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

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

Scientific notation3.482461 × 10^6

Engineering notation3.482461 × 10^6

In other bases

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

Quinary1342414321base 5; one hand: 10 digits

Septenary41412643base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001101010010001101011101

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 23 5d

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

At each machine width

32-bit00000000001101010010001101011101

64-bit0000000000000000000000000000000000000000001101010010001101011101

One's complement11111111110010101101110010100010at 32 bits, every bit flipped

Bits reversed10111010110001001010110000000000at 32 bits

Rotated left by 100000000011010100100011010111010at 32 bits, wrapping

Shifted left by 111010100100011010111010= 6,964,922, no wrap

Shifted right by 1110101001000110101110= 1,741,230, discarding the low bit

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

Nearest landmarks

Next prime3,482,519+58

Previous prime3,482,443−18

Distance to nearest prime0, it is prime

Nearest square below3,481,956

Nearest square above3,485,689

Powers & multiples

3,482,461 to the power 212,127,534,616,521

3,482,461 to the power 342,233,666,328,184,338,181

3,482,461 to the power 4147,077,095,874,915,158,526,143,441

3,482,461 to the power 5512,190,250,377,652,917,876,112,013,688,301

First ten multiples3,482,461, 6,964,922, 10,447,383, 13,929,844, 17,412,305, 20,894,766, 24,377,227, 27,859,688, 31,342,149, 34,824,610

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 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time

Highest value reached10,447,3843× the starting value

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

First steps3,482,461 → 10,447,384 → 5,223,692 → 2,611,846 → 1,305,923 → 3,917,770 → 1,958,885 → 5,876,656 → 2,938,328 → 1,469,164 → …

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

As a percentage & fraction

As a percentage348,246,100%

3,482,461% as a decimal34,824.61

3,482,461% of 1003,482,461

3,482,461% of 1,00034,824,610

As a fraction of 1003,482,461/100

Read another way

As seconds40 days, 7 hours and 21 minutes

As bytes3.321 MiB

As a 24-bit colour#35235D

Keep nerding

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