Base | Representation |
---|---|
bin | 1001001001010011111000… |
… | …1001000100100000001110 |
3 | 1022121022011100001202021222 |
4 | 2102110332021010200032 |
5 | 2304222242104130240 |
6 | 33215243322123342 |
7 | 2055330114162650 |
oct | 222247611044016 |
9 | 38538140052258 |
10 | 10055561005070 |
11 | 32275a3048529 |
12 | 1164a03050552 |
13 | 57c30a04b499 |
14 | 26a9982366d0 |
15 | 12687cb07eb5 |
hex | 9253e24480e |
10055561005070 has 16 divisors (see below), whose sum is σ = 20685725496288. Its totient is φ = 3447620916000.
The previous prime is 10055561004911. The next prime is 10055561005153. The reversal of 10055561005070 is 7050016555001.
It is a super-2 number, since 2×100555610050702 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10055561005070.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71825435681 + ... + 71825435820.
It is an arithmetic number, because the mean of its divisors is an integer number (1292857843518).
Almost surely, 210055561005070 is an apocalyptic number.
10055561005070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10055561005070 is an abundant number, since it is smaller than the sum of its proper divisors (10630164491218).
10055561005070 is a wasteful number, since it uses less digits than its factorization.
10055561005070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143650871515.
The product of its (nonzero) digits is 26250, while the sum is 35.
The spelling of 10055561005070 in words is "ten trillion, fifty-five billion, five hundred sixty-one million, five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •