Base | Representation |
---|---|
bin | 10001111010110110111… |
… | …101111111111000000111 |
3 | 11100201112111110102222001 |
4 | 101322312331333320013 |
5 | 130133432132234031 |
6 | 2341413350050131 |
7 | 154652664201331 |
oct | 21726675777007 |
9 | 4321474412861 |
10 | 1231430352391 |
11 | 435279370038 |
12 | 17a7ab649947 |
13 | 8c17b0c7a65 |
14 | 4385c906451 |
15 | 220741a2861 |
hex | 11eb6f7fe07 |
1231430352391 has 2 divisors, whose sum is σ = 1231430352392. Its totient is φ = 1231430352390.
The previous prime is 1231430352319. The next prime is 1231430352407. The reversal of 1231430352391 is 1932530341321.
Together with previous prime (1231430352319) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1231430352391 - 27 = 1231430352263 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1231430352391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1231430358391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615715176195 + 615715176196.
It is an arithmetic number, because the mean of its divisors is an integer number (615715176196).
Almost surely, 21231430352391 is an apocalyptic number.
1231430352391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1231430352391 is an equidigital number, since it uses as much as digits as its factorization.
1231430352391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 37.
The spelling of 1231430352391 in words is "one trillion, two hundred thirty-one billion, four hundred thirty million, three hundred fifty-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •