Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …0001111011000011000001 |
3 | 1022102222222110000120201001 |
4 | 2101223003101323003001 |
5 | 2303003101303230410 |
6 | 33142441101212001 |
7 | 2052144522340405 |
oct | 221530321730301 |
9 | 38388873016631 |
10 | 10010550055105 |
11 | 320a4a5593626 |
12 | 1158140b61001 |
13 | 577cb5aa5292 |
14 | 268728357105 |
15 | 1255e625533a |
hex | 91ac347b0c1 |
10010550055105 has 8 divisors (see below), whose sum is σ = 12013006430592. Its totient is φ = 8008209134448.
The previous prime is 10010550055069. The next prime is 10010550055169. The reversal of 10010550055105 is 50155005501001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10010550055105 - 211 = 10010550053057 is a prime.
It is a super-2 number, since 2×100105500551052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 28672839 + ... + 29019868.
It is an arithmetic number, because the mean of its divisors is an integer number (1501625803824).
Almost surely, 210010550055105 is an apocalyptic number.
It is an amenable number.
10010550055105 is a deficient number, since it is larger than the sum of its proper divisors (2002456375487).
10010550055105 is an equidigital number, since it uses as much as digits as its factorization.
10010550055105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57727415.
The product of its (nonzero) digits is 3125, while the sum is 28.
Adding to 10010550055105 its reverse (50155005501001), we get a palindrome (60165555556106).
The spelling of 10010550055105 in words is "ten trillion, ten billion, five hundred fifty million, fifty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •