Recognised as Number
55,902
- Positive
- Even
- Composite
- 5 digits
55,902 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,902
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 7 × 11^3
Distinct prime factors42, 3, 7, 11
Number of divisors32
Sum of divisors σ(n)140,544
Aliquot sum84,642sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)14,520integers below n that share no factor with it
Carmichael function λ(n)3,630the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 121, 154, 231, 242, 363, 462, 726, 847, 1,331, 1,694, 2,541, 2,662, 3,993, 5,082, 7,986, 9,317, 18,634, 27,951, 55,90232 in total
Arithmetic
Representations
Decimal55,902
Binary110110100101111016 bits
Octal155136
HexadecimalDA5E
Base 36174U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, nine hundred and two
Ordinalfifty-five thousand, nine hundred and second
Scientific notation5.5902 × 10^4
Engineering notation55.902 × 10^3
In other bases
Ternary2211200110base 3; the most digit-efficient integer base after e: 10 digits
Quinary3242102base 5; one hand: 7 digits
Septenary321660base 7: 6 digits
Nonary84613base 9; each digit is two ternary digits: 5 digits
Duodecimal28426base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6jf2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:31:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100TTT00110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111110100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101101001011110
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 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
Bytes2da 5e
Gray code1011011101110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101101001011110
32-bit00000000000000001101101001011110
64-bit0000000000000000000000000000000000000000000000001101101001011110
One's complement0010010110100001at 16 bits, every bit flipped
Bits reversed0111101001011011at 16 bits
Rotated left by 11011010010111101at 16 bits, wrapping
Shifted left by 111011010010111100= 111,804, no wrap
Shifted right by 1110110100101111= 27,951, discarding the low bit
These bits as a double2.76192577 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
55,902 to the power 23,125,033,604
55,902 to the power 3174,695,628,530,808
55,902 to the power 49,765,835,026,129,228,816
55,902 to the power 5545,929,709,630,676,149,272,032
First ten multiples55,902, 111,804, 167,706, 223,608, 279,510, 335,412, 391,314, 447,216, 503,118, 559,020
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,902 → 27,951 → 83,854 → 41,927 → 125,782 → 62,891 → 188,674 → 94,337 → 283,012 → 141,506 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,590,200%
55,902% as a decimal559.02
55,902% of 10055,902
55,902% of 1,000559,020
As a fraction of 10055,902/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 55,902
Nerdulate something else
Nothing in mind? Surprise me · today’s page