Base | Representation |
---|---|
bin | 10100110100111010001… |
… | …010110011011010011001 |
3 | 12001211011210100000222122 |
4 | 110310322022303122121 |
5 | 141422044201120441 |
6 | 3013252331231025 |
7 | 205254320306564 |
oct | 24647212633231 |
9 | 5054153300878 |
10 | 1431200020121 |
11 | 501a72111193 |
12 | 1b1461ba8475 |
13 | a4c6679c641 |
14 | 4d3b018b4db |
15 | 273672ca34b |
hex | 14d3a2b3699 |
1431200020121 has 2 divisors, whose sum is σ = 1431200020122. Its totient is φ = 1431200020120.
The previous prime is 1431200020111. The next prime is 1431200020127. The reversal of 1431200020121 is 1210200021341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1321764102400 + 109435917721 = 1149680^2 + 330811^2 .
It is an emirp because it is prime and its reverse (1210200021341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1431200020121 - 26 = 1431200020057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1431200020121.
It is not a weakly prime, because it can be changed into another prime (1431200020127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 715600010060 + 715600010061.
It is an arithmetic number, because the mean of its divisors is an integer number (715600010061).
Almost surely, 21431200020121 is an apocalyptic number.
It is an amenable number.
1431200020121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431200020121 is an equidigital number, since it uses as much as digits as its factorization.
1431200020121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1431200020121 its reverse (1210200021341), we get a palindrome (2641400041462).
The spelling of 1431200020121 in words is "one trillion, four hundred thirty-one billion, two hundred million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •