Base | Representation |
---|---|
bin | 100000011101110111111… |
… | …011111101000101001101 |
3 | 21220021212012201000102102 |
4 | 200131313323331011031 |
5 | 243023243124411023 |
6 | 4424541525004445 |
7 | 320122513031312 |
oct | 40356773750515 |
9 | 7807765630372 |
10 | 2231100232013 |
11 | 790227a09674 |
12 | 30049ab53725 |
13 | 132512b7aaa3 |
14 | 79db3178d09 |
15 | 3d08195a628 |
hex | 20777efd14d |
2231100232013 has 2 divisors, whose sum is σ = 2231100232014. Its totient is φ = 2231100232012.
The previous prime is 2231100231991. The next prime is 2231100232073. The reversal of 2231100232013 is 3102320011322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1505582988484 + 725517243529 = 1227022^2 + 851773^2 .
It is a cyclic number.
It is not a de Polignac number, because 2231100232013 - 26 = 2231100231949 is a prime.
It is a super-3 number, since 3×22311002320133 (a number of 38 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2231100232073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1115550116006 + 1115550116007.
It is an arithmetic number, because the mean of its divisors is an integer number (1115550116007).
Almost surely, 22231100232013 is an apocalyptic number.
It is an amenable number.
2231100232013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2231100232013 is an equidigital number, since it uses as much as digits as its factorization.
2231100232013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2231100232013 its reverse (3102320011322), we get a palindrome (5333420243335).
The spelling of 2231100232013 in words is "two trillion, two hundred thirty-one billion, one hundred million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •