Recognised as Number

5,336,465

Positive
Odd
Composite
7 digits

5,336,465 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value5,336,465

Digit count7

Digit sum32

Digit product32,400

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 1,067,293

Distinct prime factors25, 1,067,293

Number of divisors4

Sum of divisors σ(n)6,403,764

Aliquot sum1,067,299sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,067,292the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,269,168

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 1,067,293, 5,336,4654 in total

Arithmetic

Previous number5,336,464

Next number5,336,466

Double10,672,930

Half2,668,232.5

Square28,477,858,696,225

Cube151,971,096,207,350,344,625

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

Cube root174.750283291≈

Negation-5,336,465

Reciprocal1.87389967 × 10^-7≈

Representations

Decimal5,336,465

Binary1010001011011011001000123 bits

Octal24266621

Hexadecimal516D91

Base 3636DN5

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

In wordsfive million, three hundred and thirty-six thousand, four hundred and sixty-five

Ordinalfive million, three hundred and thirty-six thousand, four hundred and sixty-fifth

Scientific notation5.336465 × 10^6

Engineering notation5.336465 × 10^6

In other bases

Ternary101001010020212base 3; the most digit-efficient integer base after e: 15 digits

Quinary2331231330base 5; one hand: 10 digits

Septenary63234131base 7: 8 digits

Nonary11033225base 9; each digit is two ternary digits: 8 digits

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

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

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

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

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

Bit-level

00000000010100010110110110010001

Bit length23 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits12within that length

Bit parityodd11 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

Bytes351 6d 91

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

At each machine width

32-bit00000000010100010110110110010001

64-bit0000000000000000000000000000000000000000010100010110110110010001

One's complement11111111101011101001001001101110at 32 bits, every bit flipped

Bits reversed10001001101101101000101000000000at 32 bits

Rotated left by 100000000101000101101101100100010at 32 bits, wrapping

Shifted left by 1101000101101101100100010= 10,672,930, no wrap

Shifted right by 11010001011011011001000= 2,668,232, discarding the low bit

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

Nearest landmarks

Next prime5,336,467+2

Previous prime5,336,447−18

Distance to nearest prime2

Nearest square below5,336,100

Nearest square above5,340,721

Powers & multiples

5,336,465 to the power 228,477,858,696,225

5,336,465 to the power 3151,971,096,207,350,344,625

5,336,465 to the power 4810,988,435,922,157,856,829,250,625

5,336,465 to the power 54,327,811,403,703,338,127,444,306,936,540,625

First ten multiples5,336,465, 10,672,930, 16,009,395, 21,345,860, 26,682,325, 32,018,790, 37,355,255, 42,691,720, 48,028,185, 53,364,650

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time

Highest value reached16,009,3963× the starting value

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

First steps5,336,465 → 16,009,396 → 8,004,698 → 4,002,349 → 12,007,048 → 6,003,524 → 3,001,762 → 1,500,881 → 4,502,644 → 2,251,322 → …

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

As a percentage & fraction

As a percentage533,646,500%

5,336,465% as a decimal53,364.65

5,336,465% of 1005,336,465

5,336,465% of 1,00053,364,650

As a fraction of 1005,336,465/100

Read another way

As seconds61 days, 18 hours and 21 minutes

As bytes5.089 MiB

As a 24-bit colour#516D91

Keep nerding

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