Recognised as Number

59,902

Positive
Even
Composite
5 digits

59,902 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value59,902

Digit count5

Digit sum25

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 61 × 491

Distinct prime factors32, 61, 491

Number of divisors8

Sum of divisors σ(n)91,512

Aliquot sum31,610sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,940the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,400

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 61, 122, 491, 982, 29,951, 59,9028 in total

Arithmetic

Previous number59,901

Next number59,903

Double119,804

Half29,951

Square3,588,249,604

Cube214,943,327,778,808

Square root244.748850866≈irrational, shown to 9 decimal places

Cube root39.127350517≈

Negation-59,902

Reciprocal0.0000166939≈

Representations

Decimal59,902

Binary111010011111111016 bits

Octal164776

HexadecimalE9FE

Base 361A7Y

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

In wordsfifty-nine thousand, nine hundred and two

Ordinalfifty-nine thousand, nine hundred and second

Scientific notation5.9902 × 10^4

Engineering notation59.902 × 10^3

In other bases

Ternary10001011121base 3; the most digit-efficient integer base after e: 11 digits

Quinary3404102base 5; one hand: 7 digits

Septenary336433base 7: 6 digits

Nonary101147base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal16:38:22base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110100111111110

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 set bits, so even; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2e9 fe

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

At each machine width

16-bit1110100111111110

32-bit00000000000000001110100111111110

64-bit0000000000000000000000000000000000000000000000001110100111111110

One's complement0001011000000001at 16 bits, every bit flipped

Bits reversed0111111110010111at 16 bits

Rotated left by 11101001111111101at 16 bits, wrapping

Shifted left by 111101001111111100= 119,804, no wrap

Shifted right by 1111010011111111= 29,951, discarding the low bit

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

Nearest landmarks

Next prime59,921+19

Previous prime59,887−15

Distance to nearest prime15

Nearest square below59,536

Nearest square above60,025

Powers & multiples

59,902 to the power 23,588,249,604

59,902 to the power 3214,943,327,778,808

59,902 to the power 412,875,535,220,606,156,816

59,902 to the power 5771,270,310,784,750,005,592,032

First ten multiples59,902, 119,804, 179,706, 239,608, 299,510, 359,412, 419,314, 479,216, 539,118, 599,020

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 6

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 7

Divisible by 12No, remainder 10

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time

Highest value reached1,535,27225× the starting value

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

First steps59,902 → 29,951 → 89,854 → 44,927 → 134,782 → 67,391 → 202,174 → 101,087 → 303,262 → 151,631 → …

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

As a percentage & fraction

As a percentage5,990,200%

59,902% as a decimal599.02

59,902% of 10059,902

59,902% of 1,000599,020

As a fraction of 10059,902/100

Read another way

As seconds16 hours, 38 minutes and 22 seconds

As bytes58.498 KiB

As a 24-bit colour#00E9FE

Keep nerding

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