Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …1110011101010111110011 |
3 | 1022110011000222221012222022 |
4 | 2101230200332131113303 |
5 | 2303014311213323443 |
6 | 33143301053502055 |
7 | 2052231500626511 |
oct | 221544076352763 |
9 | 38404028835868 |
10 | 10012122011123 |
11 | 3210131950431 |
12 | 11584bb4a192b |
13 | 5781a666c47b |
14 | 26883702b4b1 |
15 | 125689264e68 |
hex | 91b20f9d5f3 |
10012122011123 has 8 divisors (see below), whose sum is σ = 10039690895520. Its totient is φ = 9984590159040.
The previous prime is 10012122011117. The next prime is 10012122011179. The reversal of 10012122011123 is 32111022121001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10012122011123 is a prime.
It is a super-2 number, since 2×100121220111232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012122011323) 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, 8716568 + ... + 9798101.
It is an arithmetic number, because the mean of its divisors is an integer number (1254961361940).
Almost surely, 210012122011123 is an apocalyptic number.
10012122011123 is a deficient number, since it is larger than the sum of its proper divisors (27568884397).
10012122011123 is an equidigital number, since it uses as much as digits as its factorization.
10012122011123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18516157.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10012122011123 its reverse (32111022121001), we get a palindrome (42123144132124).
The spelling of 10012122011123 in words is "ten trillion, twelve billion, one hundred twenty-two million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •