Base | Representation |
---|---|
bin | 11101000111000011111… |
… | …00011100000110101111 |
3 | 10112121202021021121100021 |
4 | 32203201330130012233 |
5 | 112341424110130111 |
6 | 2043255100543011 |
7 | 132156314216626 |
oct | 16434174340657 |
9 | 3477667247307 |
10 | 1000223130031 |
11 | 356212976884 |
12 | 141a24851a67 |
13 | 73422590b48 |
14 | 365a7d2a6bd |
15 | 1b04113dd71 |
hex | e8e1f1c1af |
1000223130031 has 2 divisors, whose sum is σ = 1000223130032. Its totient is φ = 1000223130030.
The previous prime is 1000223129981. The next prime is 1000223130047. The reversal of 1000223130031 is 1300313220001.
It is an a-pointer prime, because the next prime (1000223130047) can be obtained adding 1000223130031 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1000223130031 - 229 = 999686259119 is a prime.
It is a super-2 number, since 2×10002231300312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000223129987 and 1000223130014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000223130061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500111565015 + 500111565016.
It is an arithmetic number, because the mean of its divisors is an integer number (500111565016).
Almost surely, 21000223130031 is an apocalyptic number.
1000223130031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000223130031 is an equidigital number, since it uses as much as digits as its factorization.
1000223130031 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 16.
Adding to 1000223130031 its reverse (1300313220001), we get a palindrome (2300536350032).
The spelling of 1000223130031 in words is "one trillion, two hundred twenty-three million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •