Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0101101010100010101011 |
3 | 1022210111222000221022020122 |
4 | 2103013301211222202223 |
5 | 2311121001433330443 |
6 | 33300304310513455 |
7 | 2062300660351652 |
oct | 223076145524253 |
9 | 38714860838218 |
10 | 10110111230123 |
11 | 3248746245a53 |
12 | 11734a796588b |
13 | 5844c16cb668 |
14 | 26d490dc8199 |
15 | 127ec1bac968 |
hex | 931f196a8ab |
10110111230123 has 8 divisors (see below), whose sum is σ = 10162584507456. Its totient is φ = 10057638873600.
The previous prime is 10110111230099. The next prime is 10110111230129. The reversal of 10110111230123 is 32103211101101.
10110111230123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10110111230123 - 226 = 10110044121259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110111230129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39696878 + ... + 39950748.
It is an arithmetic number, because the mean of its divisors is an integer number (1270323063432).
Almost surely, 210110111230123 is an apocalyptic number.
10110111230123 is a deficient number, since it is larger than the sum of its proper divisors (52473277333).
10110111230123 is a wasteful number, since it uses less digits than its factorization.
10110111230123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460405.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10110111230123 its reverse (32103211101101), we get a palindrome (42213322331224).
The spelling of 10110111230123 in words is "ten trillion, one hundred ten billion, one hundred eleven million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •