Base | Representation |
---|---|
bin | 1001001101000100101011… |
… | …1111011110001100100001 |
3 | 1022211111000012210220120020 |
4 | 2103101022333132030201 |
5 | 2311302132440231423 |
6 | 33305053423504053 |
7 | 2063106006014244 |
oct | 223211277361441 |
9 | 38744005726506 |
10 | 10120201102113 |
11 | 3251a53764133 |
12 | 1175442a58029 |
13 | 58543bbc470b |
14 | 26db6b06325b |
15 | 1283b28be4e3 |
hex | 9344afde321 |
10120201102113 has 16 divisors (see below), whose sum is σ = 13960200403200. Its totient is φ = 6513544679040.
The previous prime is 10120201102097. The next prime is 10120201102147. The reversal of 10120201102113 is 31120110202101.
10120201102113 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 10120201102113 - 24 = 10120201102097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10120201102092 and 10120201102101.
It is not an unprimeable number, because it can be changed into a prime (10120200102113) 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, 4487593 + ... + 6354438.
It is an arithmetic number, because the mean of its divisors is an integer number (872512525200).
Almost surely, 210120201102113 is an apocalyptic number.
It is an amenable number.
10120201102113 is a deficient number, since it is larger than the sum of its proper divisors (3839999301087).
10120201102113 is a wasteful number, since it uses less digits than its factorization.
10120201102113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10852792.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10120201102113 its reverse (31120110202101), we get a palindrome (41240311304214).
The spelling of 10120201102113 in words is "ten trillion, one hundred twenty billion, two hundred one million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •