Base | Representation |
---|---|
bin | 1001001100011111110110… |
… | …0011100101000111110111 |
3 | 1022210112111000201222202221 |
4 | 2103013331203211013313 |
5 | 2311121404333311411 |
6 | 33300340242143211 |
7 | 2062305646065466 |
oct | 223077543450767 |
9 | 38715430658687 |
10 | 10110312010231 |
11 | 3248839611024 |
12 | 1173543051b07 |
13 | 584524199a64 |
14 | 26d4ad9309dd |
15 | 127ed461d071 |
hex | 931fd8e51f7 |
10110312010231 has 4 divisors (see below), whose sum is σ = 10642433695000. Its totient is φ = 9578190325464.
The previous prime is 10110312010223. The next prime is 10110312010243. The reversal of 10110312010231 is 13201021301101.
It is a happy number.
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 10110312010231 - 23 = 10110312010223 is a prime.
It is a super-2 number, since 2×101103120102312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110312017231) 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, 266060842356 + ... + 266060842393.
It is an arithmetic number, because the mean of its divisors is an integer number (2660608423750).
Almost surely, 210110312010231 is an apocalyptic number.
10110312010231 is a deficient number, since it is larger than the sum of its proper divisors (532121684769).
10110312010231 is an equidigital number, since it uses as much as digits as its factorization.
10110312010231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532121684768.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10110312010231 its reverse (13201021301101), we get a palindrome (23311333311332).
The spelling of 10110312010231 in words is "ten trillion, one hundred ten billion, three hundred twelve million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •