Recognised as Number

4,466,009

Positive
Odd
Prime
7 digits

4,466,009 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value4,466,009

Digit count7

Digit sum29

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,466,009

Distinct prime factors14,466,009

Number of divisors2

Sum of divisors σ(n)4,466,010

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,466,008integers below n that share no factor with it

Carmichael function λ(n)4,466,008the 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, 4,466,0092 in total

Arithmetic

Previous number4,466,008

Next number4,466,010

Double8,932,018

Half2,233,004.5

Square19,945,236,388,081

Cube89,075,605,216,297,238,729

Square root2,113.293401305≈irrational, shown to 9 decimal places

Cube root164.679623207≈

Negation-4,466,009

Reciprocal2.23913566 × 10^-7≈

Representations

Decimal4,466,009

Binary1000100001001010101100123 bits

Octal21022531

Hexadecimal442559

Base 362NPZT

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

In wordsfour million, four hundred and sixty-six thousand and nine

Ordinalfour million, four hundred and sixty-six thousand and ninth

Scientific notation4.466009 × 10^6

Engineering notation4.466009 × 10^6

In other bases

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

Quinary2120403014base 5; one hand: 10 digits

Septenary52650302base 7: 8 digits

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

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

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

Sexagesimal20:40:33:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001000010010101011001

Bit length23 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits14within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes344 25 59

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

At each machine width

32-bit00000000010001000010010101011001

64-bit0000000000000000000000000000000000000000010001000010010101011001

One's complement11111111101110111101101010100110at 32 bits, every bit flipped

Bits reversed10011010101001000010001000000000at 32 bits

Rotated left by 100000000100010000100101010110010at 32 bits, wrapping

Shifted left by 1100010000100101010110010= 8,932,018, no wrap

Shifted right by 11000100001001010101100= 2,233,004, discarding the low bit

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

Nearest landmarks

Next prime4,466,017+8

Previous prime4,465,973−36

Distance to nearest prime0, it is prime

Nearest square below4,464,769

Nearest square above4,468,996

Powers & multiples

4,466,009 to the power 219,945,236,388,081

4,466,009 to the power 389,075,605,216,297,238,729

4,466,009 to the power 4397,812,454,576,430,414,838,862,561

4,466,009 to the power 51,776,634,002,450,429,420,544,093,747,189,049

First ten multiples4,466,009, 8,932,018, 13,398,027, 17,864,036, 22,330,045, 26,796,054, 31,262,063, 35,728,072, 40,194,081, 44,660,090

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1118the total stopping time

Highest value reached15,072,7843× the starting value

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

First steps4,466,009 → 13,398,028 → 6,699,014 → 3,349,507 → 10,048,522 → 5,024,261 → 15,072,784 → 7,536,392 → 3,768,196 → 1,884,098 → …

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

As a percentage & fraction

As a percentage446,600,900%

4,466,009% as a decimal44,660.09

4,466,009% of 1004,466,009

4,466,009% of 1,00044,660,090

As a fraction of 1004,466,009/100

Read another way

As seconds51 days, 16 hours and 33 minutes

As bytes4.259 MiB

As a 24-bit colour#442559

Keep nerding

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