Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …1110010010100000001011 |
3 | 1110100002212010211210001111 |
4 | 2201222333232102200023 |
5 | 2424011241003310443 |
6 | 35343510420231151 |
7 | 2224446130635232 |
oct | 241527756224013 |
9 | 43302763753044 |
10 | 11110002010123 |
11 | 35a37a8552285 |
12 | 12b523923b4b7 |
13 | 627890175b83 |
14 | 2a5a26b1db19 |
15 | 143ee3a4c69d |
hex | a1abfb9280b |
11110002010123 has 8 divisors (see below), whose sum is σ = 11297318098880. Its totient is φ = 10923853000320.
The previous prime is 11110002010099. The next prime is 11110002010183. The reversal of 11110002010123 is 32101020001111.
It is a happy number.
11110002010123 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 11110002010123 - 233 = 11101412075531 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110002010183) 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, 291750540 + ... + 291788617.
It is an arithmetic number, because the mean of its divisors is an integer number (1412164762360).
Almost surely, 211110002010123 is an apocalyptic number.
11110002010123 is a deficient number, since it is larger than the sum of its proper divisors (187316088757).
11110002010123 is an equidigital number, since it uses as much as digits as its factorization.
11110002010123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 583539477.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11110002010123 its reverse (32101020001111), we get a palindrome (43211022011234).
The spelling of 11110002010123 in words is "eleven trillion, one hundred ten billion, two million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •