Base | Representation |
---|---|
bin | 1001001101001011111000… |
… | …0101010001010110111001 |
3 | 1022211122222210010210120111 |
4 | 2103102332011101112321 |
5 | 2311320111243032413 |
6 | 33310013201424321 |
7 | 2063204603261536 |
oct | 223227605212671 |
9 | 38748883123514 |
10 | 10122132002233 |
11 | 32528546a4a59 |
12 | 11758a163b0a1 |
13 | 585688c56b74 |
14 | 26dcb1691d8d |
15 | 128477182d3d |
hex | 934be1515b9 |
10122132002233 has 2 divisors, whose sum is σ = 10122132002234. Its totient is φ = 10122132002232.
The previous prime is 10122132002131. The next prime is 10122132002237. The reversal of 10122132002233 is 33220023122101.
10122132002233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10067599010704 + 54532991529 = 3172948^2 + 233523^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122132002233 is a prime.
It is not a weakly prime, because it can be changed into another prime (10122132002237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061066001116 + 5061066001117.
It is an arithmetic number, because the mean of its divisors is an integer number (5061066001117).
Almost surely, 210122132002233 is an apocalyptic number.
It is an amenable number.
10122132002233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122132002233 is an equidigital number, since it uses as much as digits as its factorization.
10122132002233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10122132002233 its reverse (33220023122101), we get a palindrome (43342155124334).
The spelling of 10122132002233 in words is "ten trillion, one hundred twenty-two billion, one hundred thirty-two million, two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •