Base | Representation |
---|---|
bin | 10001111001100001101… |
… | …110001000111101101111 |
3 | 11100120211211020201100122 |
4 | 101321201232020331233 |
5 | 130123020013210301 |
6 | 2341015415315155 |
7 | 154602356421413 |
oct | 21714156107557 |
9 | 4316754221318 |
10 | 1230000131951 |
11 | 434705010278 |
12 | 17a47067babb |
13 | 8bcb09c7b86 |
14 | 437649a8d43 |
15 | 21edd83d81b |
hex | 11e61b88f6f |
1230000131951 has 2 divisors, whose sum is σ = 1230000131952. Its totient is φ = 1230000131950.
The previous prime is 1230000131939. The next prime is 1230000132077. The reversal of 1230000131951 is 1591310000321.
It is a weak prime.
It is an emirp because it is prime and its reverse (1591310000321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1230000131951 - 26 = 1230000131887 is a prime.
It is a super-2 number, since 2×12300001319512 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1230000131951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1230000131911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615000065975 + 615000065976.
It is an arithmetic number, because the mean of its divisors is an integer number (615000065976).
Almost surely, 21230000131951 is an apocalyptic number.
1230000131951 is a deficient number, since it is larger than the sum of its proper divisors (1).
1230000131951 is an equidigital number, since it uses as much as digits as its factorization.
1230000131951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 26.
The spelling of 1230000131951 in words is "one trillion, two hundred thirty billion, one hundred thirty-one thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •