Base | Representation |
---|---|
bin | 10100011000110011010… |
… | …111011110010111110111 |
3 | 11221221021120102120211001 |
4 | 110120303113132113313 |
5 | 140423242402131411 |
6 | 2551341545024131 |
7 | 203135416055062 |
oct | 24306327362767 |
9 | 4857246376731 |
10 | 1401021130231 |
11 | 4a01959a3578 |
12 | 1a763b185047 |
13 | a2167331a48 |
14 | 4bb4a0978d9 |
15 | 2669cb16dc1 |
hex | 146335de5f7 |
1401021130231 has 2 divisors, whose sum is σ = 1401021130232. Its totient is φ = 1401021130230.
The previous prime is 1401021130219. The next prime is 1401021130291. The reversal of 1401021130231 is 1320311201041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1401021130231 - 29 = 1401021129719 is a prime.
It is a super-2 number, since 2×14010211302312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1401021130199 and 1401021130208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1401021130291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700510565115 + 700510565116.
It is an arithmetic number, because the mean of its divisors is an integer number (700510565116).
Almost surely, 21401021130231 is an apocalyptic number.
1401021130231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401021130231 is an equidigital number, since it uses as much as digits as its factorization.
1401021130231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1401021130231 its reverse (1320311201041), we get a palindrome (2721332331272).
The spelling of 1401021130231 in words is "one trillion, four hundred one billion, twenty-one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •