Base | Representation |
---|---|
bin | 1010100100000111110110… |
… | …10111100110000010100111 |
3 | 10001020220022020102012220021 |
4 | 11102003323113212002213 |
5 | 11021110402000344421 |
6 | 121224205155220011 |
7 | 4615261521163525 |
oct | 522037327460247 |
9 | 101226266365807 |
10 | 23231400403111 |
11 | 744742198258a |
12 | 2732498ba7607 |
13 | cc6933687c94 |
14 | 5a4597659315 |
15 | 2a447e59c341 |
hex | 1520fb5e60a7 |
23231400403111 has 4 divisors (see below), whose sum is σ = 23233783365000. Its totient is φ = 23229017441224.
The previous prime is 23231400403063. The next prime is 23231400403171. The reversal of 23231400403111 is 11130400413232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23231400403111 - 211 = 23231400401063 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 (23231400403171) 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 in 3 ways as a sum of consecutive naturals, for example, 1191466321 + ... + 1191485818.
It is an arithmetic number, because the mean of its divisors is an integer number (5808445841250).
Almost surely, 223231400403111 is an apocalyptic number.
23231400403111 is a deficient number, since it is larger than the sum of its proper divisors (2382961889).
23231400403111 is an equidigital number, since it uses as much as digits as its factorization.
23231400403111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2382961888.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 23231400403111 its reverse (11130400413232), we get a palindrome (34361800816343).
The spelling of 23231400403111 in words is "twenty-three trillion, two hundred thirty-one billion, four hundred million, four hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •