Base | Representation |
---|---|
bin | 101111101001000111… |
… | …0010111101100010111 |
3 | 100210002020122000002101 |
4 | 1133102032113230113 |
5 | 3134013133331411 |
6 | 115000124422531 |
7 | 10251240052030 |
oct | 1372216275427 |
9 | 323066560071 |
10 | 102311230231 |
11 | 3a432027631 |
12 | 179b39a7a47 |
13 | 98565b73b2 |
14 | 4d47db3a87 |
15 | 29dc0c88c1 |
hex | 17d2397b17 |
102311230231 has 4 divisors (see below), whose sum is σ = 116927120272. Its totient is φ = 87695340192.
The previous prime is 102311230223. The next prime is 102311230243. The reversal of 102311230231 is 132032113201.
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 102311230231 - 23 = 102311230223 is a prime.
It is a super-2 number, since 2×1023112302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102311230199 and 102311230208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102311230201) 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, 7307945010 + ... + 7307945023.
It is an arithmetic number, because the mean of its divisors is an integer number (29231780068).
Almost surely, 2102311230231 is an apocalyptic number.
102311230231 is a deficient number, since it is larger than the sum of its proper divisors (14615890041).
102311230231 is an equidigital number, since it uses as much as digits as its factorization.
102311230231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14615890040.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 102311230231 its reverse (132032113201), we get a palindrome (234343343432).
The spelling of 102311230231 in words is "one hundred two billion, three hundred eleven million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •