Recognised as Number

53,407

Positive
Odd
Prime
5 digits

53,407 is an odd 5-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 value53,407

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation53,407

Distinct prime factors153,407

Number of divisors2

Sum of divisors σ(n)53,408

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)53,406integers below n that share no factor with it

Carmichael function λ(n)53,406the 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, 53,4072 in total

Arithmetic

Previous number53,406

Next number53,408

Double106,814

Half26,703.5

Square2,852,307,649

Cube152,333,194,610,143

Square root231.099545651≈irrational, shown to 9 decimal places

Cube root37.658763929≈

Negation-53,407

Reciprocal0.0000187241≈

Representations

Decimal53,407

Binary110100001001111116 bits

Octal150237

HexadecimalD09F

Base 36157J

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

In wordsfifty-three thousand, four hundred and seven

Ordinalfifty-three thousand, four hundred and seventh

Scientific notation5.3407 × 10^4

Engineering notation53.407 × 10^3

In other bases

Ternary2201021001base 3; the most digit-efficient integer base after e: 10 digits

Quinary3202112base 5; one hand: 7 digits

Septenary311464base 7: 6 digits

Nonary81231base 9; each digit is two ternary digits: 5 digits

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

Vigesimal6da7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal14:50:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101000010011111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2d0 9f

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

At each machine width

16-bit1101000010011111

32-bit00000000000000001101000010011111

64-bit0000000000000000000000000000000000000000000000001101000010011111

One's complement0010111101100000at 16 bits, every bit flipped

Bits reversed1111100100001011at 16 bits

Rotated left by 11010000100111111at 16 bits, wrapping

Shifted left by 111010000100111110= 106,814, no wrap

Shifted right by 1110100001001111= 26,703, discarding the low bit

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

Nearest landmarks

Next prime53,411+4

Previous prime53,401−6

Distance to nearest prime0, it is prime

Nearest square below53,361

Nearest square above53,824

Powers & multiples

53,407 to the power 22,852,307,649

53,407 to the power 3152,333,194,610,143

53,407 to the power 48,135,658,924,543,907,201

53,407 to the power 5434,501,136,183,116,451,883,807

First ten multiples53,407, 106,814, 160,221, 213,628, 267,035, 320,442, 373,849, 427,256, 480,663, 534,070

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 2

Divisible by 12No, remainder 7

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1171the total stopping time

Highest value reached3,079,78057× the starting value

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

First steps53,407 → 160,222 → 80,111 → 240,334 → 120,167 → 360,502 → 180,251 → 540,754 → 270,377 → 811,132 → …

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

As a percentage & fraction

As a percentage5,340,700%

53,407% as a decimal534.07

53,407% of 10053,407

53,407% of 1,000534,070

As a fraction of 10053,407/100

Read another way

As seconds14 hours, 50 minutes and 7 seconds

As bytes52.155 KiB

As a 24-bit colour#00D09F

Keep nerding

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