Base | Representation |
---|---|
bin | 10001100111010010101… |
… | …001111010100101110111 |
3 | 11021201022020210122012211 |
4 | 101213102221322211313 |
5 | 124312420010412211 |
6 | 2324020445354251 |
7 | 153310223232646 |
oct | 21472251724567 |
9 | 4251266718184 |
10 | 1210420013431 |
11 | 4273775a6442 |
12 | 176707268987 |
13 | 8a1b0303025 |
14 | 4282838135d |
15 | 217448b1e21 |
hex | 119d2a7a977 |
1210420013431 has 2 divisors, whose sum is σ = 1210420013432. Its totient is φ = 1210420013430.
The previous prime is 1210420013401. The next prime is 1210420013447. The reversal of 1210420013431 is 1343100240121.
It is a strong prime.
It is an emirp because it is prime and its reverse (1343100240121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210420013431 - 219 = 1210419489143 is a prime.
It is a super-2 number, since 2×12104200134312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210420013401) 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, 605210006715 + 605210006716.
It is an arithmetic number, because the mean of its divisors is an integer number (605210006716).
Almost surely, 21210420013431 is an apocalyptic number.
1210420013431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210420013431 is an equidigital number, since it uses as much as digits as its factorization.
1210420013431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1210420013431 its reverse (1343100240121), we get a palindrome (2553520253552).
The spelling of 1210420013431 in words is "one trillion, two hundred ten billion, four hundred twenty million, thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •