Base | Representation |
---|---|
bin | 1001001100110011111110… |
… | …00001101000110111101101 |
3 | 2122122002211221101021220001 |
4 | 10212121333001220313231 |
5 | 10122432430314201031 |
6 | 111010104520024301 |
7 | 4155446423640355 |
oct | 446317701506755 |
9 | 78562757337801 |
10 | 20231427100141 |
11 | 64a0111190774 |
12 | 2328ba0002091 |
13 | b39a7a54484a |
14 | 4dd2c6111b65 |
15 | 2513ec37d861 |
hex | 12667f068ded |
20231427100141 has 4 divisors (see below), whose sum is σ = 21296239052800. Its totient is φ = 19166615147484.
The previous prime is 20231427100099. The next prime is 20231427100249. The reversal of 20231427100141 is 14100172413202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20231427100141 - 219 = 20231426575853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20231407100141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 532405976301 + ... + 532405976338.
It is an arithmetic number, because the mean of its divisors is an integer number (5324059763200).
Almost surely, 220231427100141 is an apocalyptic number.
It is an amenable number.
20231427100141 is a deficient number, since it is larger than the sum of its proper divisors (1064811952659).
20231427100141 is a wasteful number, since it uses less digits than its factorization.
20231427100141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064811952658.
The product of its (nonzero) digits is 2688, while the sum is 28.
Adding to 20231427100141 its reverse (14100172413202), we get a palindrome (34331599513343).
The spelling of 20231427100141 in words is "twenty trillion, two hundred thirty-one billion, four hundred twenty-seven million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •