Base | Representation |
---|---|
bin | 11110000000111100100… |
… | …01011101001010001001 |
3 | 10122120222001222101010202 |
4 | 33000132101131022021 |
5 | 113344100302342101 |
6 | 2105434523021545 |
7 | 134336401505615 |
oct | 17003621351211 |
9 | 3576861871122 |
10 | 1031300043401 |
11 | 36840aa96861 |
12 | 147a5836a8b5 |
13 | 76335ab2594 |
14 | 37cb53c4345 |
15 | 1bc5e58d36b |
hex | f01e45d289 |
1031300043401 has 2 divisors, whose sum is σ = 1031300043402. Its totient is φ = 1031300043400.
The previous prime is 1031300043379. The next prime is 1031300043421. The reversal of 1031300043401 is 1043400031301.
It is an a-pointer prime, because the next prime (1031300043421) can be obtained adding 1031300043401 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 639198651001 + 392101392400 = 799499^2 + 626180^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031300043401 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1031300043421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515650021700 + 515650021701.
It is an arithmetic number, because the mean of its divisors is an integer number (515650021701).
Almost surely, 21031300043401 is an apocalyptic number.
It is an amenable number.
1031300043401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031300043401 is an equidigital number, since it uses as much as digits as its factorization.
1031300043401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1031300043401 its reverse (1043400031301), we get a palindrome (2074700074702).
The spelling of 1031300043401 in words is "one trillion, thirty-one billion, three hundred million, forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •