Base | Representation |
---|---|
bin | 1001000110101010010110… |
… | …0000101011001111100111 |
3 | 1022102221200122012221102002 |
4 | 2101222211200223033213 |
5 | 2303001040423343210 |
6 | 33142315340235515 |
7 | 2052126246156623 |
oct | 221524540531747 |
9 | 38387618187362 |
10 | 10010050606055 |
11 | 320a269673115 |
12 | 115802183bb9b |
13 | 577c36483bb6 |
14 | 2686bbca6183 |
15 | 1255b749a4a5 |
hex | 91aa582b3e7 |
10010050606055 has 16 divisors (see below), whose sum is σ = 12095468264064. Its totient is φ = 7952493669120.
The previous prime is 10010050606051. The next prime is 10010050606067. The reversal of 10010050606055 is 55060605001001.
10010050606055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10010050606055 - 22 = 10010050606051 is a prime.
It is a super-2 number, since 2×100100506060552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010050606051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2260991 + ... + 5013200.
It is an arithmetic number, because the mean of its divisors is an integer number (755966766504).
Almost surely, 210010050606055 is an apocalyptic number.
10010050606055 is a deficient number, since it is larger than the sum of its proper divisors (2085417658009).
10010050606055 is a wasteful number, since it uses less digits than its factorization.
10010050606055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7276106.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 10010050606055 its reverse (55060605001001), we get a palindrome (65070655607056).
The spelling of 10010050606055 in words is "ten trillion, ten billion, fifty million, six hundred six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •