Base | Representation |
---|---|
bin | 1001100110111101111010… |
… | …11110011110100000100101 |
3 | 2202211000112121021211200112 |
4 | 10303132331132132200211 |
5 | 10232143442442342013 |
6 | 112535013340222405 |
7 | 4310413101103142 |
oct | 463367536364045 |
9 | 82730477254615 |
10 | 21130123012133 |
11 | 6807264640983 |
12 | 24531ab53aa05 |
13 | ba373ca94035 |
14 | 5309bc2313c9 |
15 | 26999a15dba8 |
hex | 1337bd79e825 |
21130123012133 has 2 divisors, whose sum is σ = 21130123012134. Its totient is φ = 21130123012132.
The previous prime is 21130123012127. The next prime is 21130123012171. The reversal of 21130123012133 is 33121032103112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15081587784004 + 6048535228129 = 3883502^2 + 2459377^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21130123012133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21130123012099 and 21130123012108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21130123612133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10565061506066 + 10565061506067.
It is an arithmetic number, because the mean of its divisors is an integer number (10565061506067).
Almost surely, 221130123012133 is an apocalyptic number.
It is an amenable number.
21130123012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21130123012133 is an equidigital number, since it uses as much as digits as its factorization.
21130123012133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21130123012133 its reverse (33121032103112), we get a palindrome (54251155115245).
The spelling of 21130123012133 in words is "twenty-one trillion, one hundred thirty billion, one hundred twenty-three million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •