Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011010001011101001011 |
3 | 10220011021222011202222212 |
4 | 100000131023101131023 |
5 | 121010300241401443 |
6 | 2201200013335335 |
7 | 142321024160021 |
oct | 20003513213513 |
9 | 3804258152885 |
10 | 1100001122123 |
11 | 394564a58072 |
12 | 15923019754b |
13 | 7c9640abc57 |
14 | 3b3516ba711 |
15 | 1d930b23618 |
hex | 1001d2d174b |
1100001122123 has 8 divisors (see below), whose sum is σ = 1113982356480. Its totient is φ = 1086021317160.
The previous prime is 1100001122117. The next prime is 1100001122153. The reversal of 1100001122123 is 3212211000011.
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 1100001122123 - 24 = 1100001122107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100001122098 and 1100001122107.
It is not an unprimeable number, because it can be changed into a prime (1100001122153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1236428 + ... + 1930998.
It is an arithmetic number, because the mean of its divisors is an integer number (139247794560).
Almost surely, 21100001122123 is an apocalyptic number.
1100001122123 is a deficient number, since it is larger than the sum of its proper divisors (13981234357).
1100001122123 is an equidigital number, since it uses as much as digits as its factorization.
1100001122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714697.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1100001122123 its reverse (3212211000011), we get a palindrome (4312212122134).
The spelling of 1100001122123 in words is "one trillion, one hundred billion, one million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •