Nerdulator> put something in

Recognised as Number

5,265,472

  • Positive
  • Even
  • Composite
  • 7 digits

5,265,472 is an even 7-digit integer and a composite number. It has 28 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,265,472
Digit count7
Digit sum31
Digit product16,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^6 × 29 × 2,837
Distinct prime factors32, 29, 2,837
Number of divisors28
Sum of divisors σ(n)10,812,780
Aliquot sum5,547,308sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,541,056integers below n that share no factor with it
Carmichael function λ(n)79,408the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,541,056
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 29, 32, 58, 64, 116, 232, 464, 928, 1,856, 2,837, 5,674, 11,348, 22,696, 45,392, 82,273, 90,784, 164,546, 181,568, 329,092, 658,184, 1,316,368, 2,632,736, 5,265,47228 in total

Arithmetic

Previous number5,265,471
Next number5,265,473
Cube145,986,239,982,578,434,048
Square root2,294.661630829≈irrational, shown to 9 decimal places
Cube root173.971898399≈
Negation-5,265,472
Reciprocal1.89916498 × 10^-7≈

Representations

Decimal5,265,472
Binary1010000010110000100000023 bits
Octal24054100
Hexadecimal505840
Base 3634UV4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, two hundred and sixty-five thousand, four hundred and seventy-two
Ordinalfive million, two hundred and sixty-five thousand, four hundred and seventy-second
Scientific notation5.265472 × 10^6
Engineering notation5.265472 × 10^6

In other bases

Ternary100220111212111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2321443342base 5; one hand: 10 digits
Septenary62520142base 7: 8 digits
Nonary10814774base 9; each digit is two ternary digits: 8 digits
Duodecimal191b194base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ci3dcbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:22:37:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010T1TTT0TT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100011010100001000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010100000101100001000000
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 even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes350 58 40
Gray code11110000111010001100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010100000101100001000000
64-bit0000000000000000000000000000000000000000010100000101100001000000
One's complement11111111101011111010011110111111at 32 bits, every bit flipped
Bits reversed00000010000110100000101000000000at 32 bits
Rotated left by 100000000101000001011000010000000at 32 bits, wrapping
Shifted left by 1101000001011000010000000= 10,530,944, no wrap
Shifted right by 11010000010110000100000= 2,632,736, discarding the low bit
These bits as a double2.60148882 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,265,473+1
Previous prime5,265,439−33
Distance to nearest prime1
Nearest square below5,262,436
Nearest square above5,267,025

Powers & multiples

5,265,472 to the power 227,725,195,382,784
5,265,472 to the power 3145,986,239,982,578,434,048
5,265,472 to the power 4768,686,459,013,547,232,283,590,656
5,265,472 to the power 54,047,497,026,714,980,572,266,742,658,629,632
First ten multiples5,265,472, 10,530,944, 15,796,416, 21,061,888, 26,327,360, 31,592,832, 36,858,304, 42,123,776, 47,389,248, 52,654,720
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 169the total stopping time
Highest value reached5,265,472
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,265,472 → 2,632,736 → 1,316,368 → 658,184 → 329,092 → 164,546 → 82,273 → 246,820 → 123,410 → 61,705 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage526,547,200%
5,265,472% as a decimal52,654.72
5,265,472% of 1005,265,472
5,265,472% of 1,00052,654,720
As a fraction of 1005,265,472/100

Read another way

As bytes5.022 MiB
As a 24-bit colour#505840

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “5265472” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.