Base | Representation |
---|---|
bin | 110011011011000001… |
… | …010011110110110100 |
3 | 12021111222012000022020 |
4 | 303123001103312310 |
5 | 1401034311130312 |
6 | 41210503033140 |
7 | 3663154425201 |
oct | 633301236664 |
9 | 167458160266 |
10 | 55214161332 |
11 | 21463a556a0 |
12 | a84b13b7b0 |
13 | 528c0a35a5 |
14 | 295b01cca8 |
15 | 168250178c |
hex | cdb053db4 |
55214161332 has 48 divisors (see below), whose sum is σ = 140559250944. Its totient is φ = 16729884000.
The previous prime is 55214161267. The next prime is 55214161333. The reversal of 55214161332 is 23316141255.
It is a super-2 number, since 2×552141613322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 55214161293 and 55214161302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55214161333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2129607 + ... + 2155377.
It is an arithmetic number, because the mean of its divisors is an integer number (2928317728).
Almost surely, 255214161332 is an apocalyptic number.
It is an amenable number.
55214161332 is an abundant number, since it is smaller than the sum of its proper divisors (85345089612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55214161332 is a wasteful number, since it uses less digits than its factorization.
55214161332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42020 (or 42018 counting only the distinct ones).
The product of its digits is 21600, while the sum is 33.
The spelling of 55214161332 in words is "fifty-five billion, two hundred fourteen million, one hundred sixty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •