Base | Representation |
---|---|
bin | 1001001101001011110001… |
… | …0011010010001101110101 |
3 | 1022211122220200220200200111 |
4 | 2103102330103102031311 |
5 | 2311320031120340313 |
6 | 33310010213143021 |
7 | 2063204061300316 |
oct | 223227423221565 |
9 | 38748820820614 |
10 | 10122102121333 |
11 | 3252839845aa4 |
12 | 117589362aa71 |
13 | 5856829c4167 |
14 | 26dcab71460d |
15 | 12847472e43d |
hex | 934bc4d2375 |
10122102121333 has 16 divisors (see below), whose sum is σ = 10243761538432. Its totient is φ = 10001180160000.
The previous prime is 10122102121321. The next prime is 10122102121357. The reversal of 10122102121333 is 33312120122101.
10122102121333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122102121333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122102122333) 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, 180979213 + ... + 181035133.
It is an arithmetic number, because the mean of its divisors is an integer number (640235096152).
Almost surely, 210122102121333 is an apocalyptic number.
It is an amenable number.
10122102121333 is a deficient number, since it is larger than the sum of its proper divisors (121659417099).
10122102121333 is a wasteful number, since it uses less digits than its factorization.
10122102121333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62476.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10122102121333 its reverse (33312120122101), we get a palindrome (43434222243434).
The spelling of 10122102121333 in words is "ten trillion, one hundred twenty-two billion, one hundred two million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •