Base | Representation |
---|---|
bin | 1001001100101010001111… |
… | …1111010100100010101001 |
3 | 1022210210200121221000111222 |
4 | 2103022203333110202221 |
5 | 2311143114200101301 |
6 | 33301521310431425 |
7 | 2062435103132540 |
oct | 223124377244251 |
9 | 38723617830458 |
10 | 10113104300201 |
11 | 3249a41802891 |
12 | 1173ba2202575 |
13 | 58487a827846 |
14 | 26d696709157 |
15 | 1280e983331b |
hex | 932a3fd48a9 |
10113104300201 has 64 divisors (see below), whose sum is σ = 12315244032000. Its totient is φ = 8112251347200.
The previous prime is 10113104300179. The next prime is 10113104300203. The reversal of 10113104300201 is 10200340131101.
10113104300201 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 10113104300201 - 26 = 10113104300137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10113104300201.
It is not an unprimeable number, because it can be changed into a prime (10113104300203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3703076006 + ... + 3703078736.
It is an arithmetic number, because the mean of its divisors is an integer number (192425688000).
Almost surely, 210113104300201 is an apocalyptic number.
It is an amenable number.
10113104300201 is a deficient number, since it is larger than the sum of its proper divisors (2202139731799).
10113104300201 is a wasteful number, since it uses less digits than its factorization.
10113104300201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3910.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10113104300201 its reverse (10200340131101), we get a palindrome (20313444431302).
The spelling of 10113104300201 in words is "ten trillion, one hundred thirteen billion, one hundred four million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •