Recognised as Number

4,472,901

Positive
Odd
Composite
7 digits

4,472,901 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,472,901

Digit count7

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^5 × 79 × 233

Distinct prime factors33, 79, 233

Number of divisors24

Sum of divisors σ(n)6,814,080

Aliquot sum2,341,179sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,931,552integers below n that share no factor with it

Carmichael function λ(n)244,296the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,931,552

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 79, 81, 233, 237, 243, 699, 711, 2,097, 2,133, 6,291, 6,399, 18,407, 18,873, 19,197, 55,221, 56,619, 165,663, 496,989, 1,490,967, 4,472,90124 in total

Arithmetic

Previous number4,472,900

Next number4,472,902

Double8,945,802

Half2,236,450.5

Square20,006,843,355,801

Cube89,488,629,653,005,648,701

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

Cube root164.764291541≈

Negation-4,472,901

Reciprocal2.23568552 × 10^-7≈

Representations

Decimal4,472,901

Binary1000100010000000100010123 bits

Octal21040105

Hexadecimal444045

Base 362NVB9

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

In wordsfour million, four hundred and seventy-two thousand, nine hundred and one

Ordinalfour million, four hundred and seventy-two thousand, nine hundred and first

Scientific notation4.472901 × 10^6

Engineering notation4.472901 × 10^6

In other bases

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

Quinary2121113101base 5; one hand: 10 digits

Septenary53006346base 7: 8 digits

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

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

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

Sexagesimal20:42:28:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001000100000001000101

Bit length23 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits17within that length

Bit parityeven6 set bits, so even; 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 40 45

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

At each machine width

32-bit00000000010001000100000001000101

64-bit0000000000000000000000000000000000000000010001000100000001000101

One's complement11111111101110111011111110111010at 32 bits, every bit flipped

Bits reversed10100010000000100010001000000000at 32 bits

Rotated left by 100000000100010001000000010001010at 32 bits, wrapping

Shifted left by 1100010001000000010001010= 8,945,802, no wrap

Shifted right by 11000100010000000100010= 2,236,450, discarding the low bit

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

Nearest landmarks

Next prime4,472,911+10

Previous prime4,472,869−32

Distance to nearest prime10

Nearest square below4,468,996

Nearest square above4,473,225

Powers & multiples

4,472,901 to the power 220,006,843,355,801

4,472,901 to the power 389,488,629,653,005,648,701

4,472,901 to the power 4400,273,781,063,558,619,080,351,601

4,472,901 to the power 51,790,384,995,592,972,410,843,123,756,464,501

First ten multiples4,472,901, 8,945,802, 13,418,703, 17,891,604, 22,364,505, 26,837,406, 31,310,307, 35,783,208, 40,256,109, 44,729,010

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time

Highest value reached13,418,7043× the starting value

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

First steps4,472,901 → 13,418,704 → 6,709,352 → 3,354,676 → 1,677,338 → 838,669 → 2,516,008 → 1,258,004 → 629,002 → 314,501 → …

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

As a percentage & fraction

As a percentage447,290,100%

4,472,901% as a decimal44,729.01

4,472,901% of 1004,472,901

4,472,901% of 1,00044,729,010

As a fraction of 1004,472,901/100

Read another way

As seconds51 days, 18 hours and 28 minutes

As bytes4.266 MiB

As a 24-bit colour#444045

Keep nerding

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