Base | Representation |
---|---|
bin | 1001000111001111110010… |
… | …0000011111111010000001 |
3 | 1022110220122000010201221000 |
4 | 2101303330200133322001 |
5 | 2303132131112041001 |
6 | 33151100452122213 |
7 | 2052633264441030 |
oct | 221637440377201 |
9 | 38426560121830 |
10 | 10020100112001 |
11 | 3213556320731 |
12 | 1159b67306369 |
13 | 578b784b5915 |
14 | 268d92834717 |
15 | 1259a4886a86 |
hex | 91cfc81fe81 |
10020100112001 has 128 divisors (see below), whose sum is σ = 17566565990400. Its totient is φ = 5523994506240.
The previous prime is 10020100111949. The next prime is 10020100112023. The reversal of 10020100112001 is 10021100102001.
It is a happy number.
10020100112001 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 10020100112001 - 218 = 10020099849857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10020100132001) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4706480905 + ... + 4706483033.
It is an arithmetic number, because the mean of its divisors is an integer number (137238796800).
Almost surely, 210020100112001 is an apocalyptic number.
It is an amenable number.
10020100112001 is a deficient number, since it is larger than the sum of its proper divisors (7546465878399).
10020100112001 is a wasteful number, since it uses less digits than its factorization.
10020100112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4276 (or 4270 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10020100112001 its reverse (10021100102001), we get a palindrome (20041200214002).
The spelling of 10020100112001 in words is "ten trillion, twenty billion, one hundred million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •