Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …10100111000010001010010 |
3 | 21012201221121222202022020211 |
4 | 30200112233310320101102 |
5 | 24202110003030200200 |
6 | 312550353132354334 |
7 | 14404422265140544 |
oct | 1440265764702122 |
9 | 235657558668224 |
10 | 55000006100050 |
11 | 1658540a661710 |
12 | 62034529159aa |
13 | 248c62ab4192b |
14 | d8202badb694 |
15 | 655a22b88aba |
hex | 3205afd38452 |
55000006100050 has 48 divisors (see below), whose sum is σ = 111601112643072. Its totient is φ = 19999805038400.
The previous prime is 55000006099967. The next prime is 55000006100099. The reversal of 55000006100050 is 5000160000055.
It is a super-2 number, since 2×550000061000502 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 55000006099994 and 55000006100030.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62702799 + ... + 63573901.
It is an arithmetic number, because the mean of its divisors is an integer number (2325023180064).
Almost surely, 255000006100050 is an apocalyptic number.
55000006100050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55000006100050 is an abundant number, since it is smaller than the sum of its proper divisors (56601106543022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55000006100050 is a wasteful number, since it uses less digits than its factorization.
55000006100050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 985923 (or 985918 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 22.
The spelling of 55000006100050 in words is "fifty-five trillion, six million, one hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •