Base | Representation |
---|---|
bin | 11111000001110111000… |
… | …011001011111110011001 |
3 | 21112211211201201020110222 |
4 | 133001313003023332121 |
5 | 234413423040244001 |
6 | 4311322100445425 |
7 | 310024260216356 |
oct | 37016703137631 |
9 | 7484751636428 |
10 | 2132301103001 |
11 | 752338424733 |
12 | 2a53073a9875 |
13 | 1260c90a90c4 |
14 | 752bd7d362d |
15 | 3a6ecd7e61b |
hex | 1f0770cbf99 |
2132301103001 has 2 divisors, whose sum is σ = 2132301103002. Its totient is φ = 2132301103000.
The previous prime is 2132301102991. The next prime is 2132301103003. The reversal of 2132301103001 is 1003011032312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1330559943001 + 801741160000 = 1153499^2 + 895400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132301103001 is a prime.
It is a super-2 number, since 2×21323011030012 (a number of 25 digits) contains 22 as substring.
Together with 2132301103003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2132301103003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066150551500 + 1066150551501.
It is an arithmetic number, because the mean of its divisors is an integer number (1066150551501).
Almost surely, 22132301103001 is an apocalyptic number.
It is an amenable number.
2132301103001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132301103001 is an equidigital number, since it uses as much as digits as its factorization.
2132301103001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2132301103001 its reverse (1003011032312), we get a palindrome (3135312135313).
The spelling of 2132301103001 in words is "two trillion, one hundred thirty-two billion, three hundred one million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •