Base | Representation |
---|---|
bin | 1010000110000111110110… |
… | …0100001011101111000001 |
3 | 1110022011211010210211011022 |
4 | 2201201331210023233001 |
5 | 2423331404321130423 |
6 | 35335224114155225 |
7 | 2223653556212540 |
oct | 241417544135701 |
9 | 43264733724138 |
10 | 11100302130113 |
11 | 359a680193919 |
12 | 12b3390882b15 |
13 | 6269a56c8cc1 |
14 | 2a53867a2157 |
15 | 143b271c3dc8 |
hex | a187d90bbc1 |
11100302130113 has 8 divisors (see below), whose sum is σ = 12686478184128. Its totient is φ = 9514230727824.
The previous prime is 11100302130103. The next prime is 11100302130173. The reversal of 11100302130113 is 31103120300111.
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 11100302130113 - 28 = 11100302129857 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11100302130091 and 11100302130100.
It is not an unprimeable number, because it can be changed into a prime (11100302130103) 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, 25935506 + ... + 26360027.
It is an arithmetic number, because the mean of its divisors is an integer number (1585809773016).
Almost surely, 211100302130113 is an apocalyptic number.
It is an amenable number.
11100302130113 is a deficient number, since it is larger than the sum of its proper divisors (1586176054015).
11100302130113 is an equidigital number, since it uses as much as digits as its factorization.
11100302130113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52325863.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11100302130113 its reverse (31103120300111), we get a palindrome (42203422430224).
The spelling of 11100302130113 in words is "eleven trillion, one hundred billion, three hundred two million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •