Base | Representation |
---|---|
bin | 110101101000001110… |
… | …1010110110000010001 |
3 | 102000021011002200020012 |
4 | 1223100131112300101 |
5 | 3341330111143001 |
6 | 124523505524305 |
7 | 11214635102111 |
oct | 1532035266021 |
9 | 360234080205 |
10 | 115166506001 |
11 | 44929543588 |
12 | 1a3a1043695 |
13 | ab249b6651 |
14 | 5807429041 |
15 | 2ee098e2bb |
hex | 1ad0756c11 |
115166506001 has 8 divisors (see below), whose sum is σ = 122195589120. Its totient is φ = 108165709888.
The previous prime is 115166505997. The next prime is 115166506009. The reversal of 115166506001 is 100605661511.
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 115166506001 - 22 = 115166505997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (115166506009) 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, 7063361 + ... + 7079646.
It is an arithmetic number, because the mean of its divisors is an integer number (15274448640).
Almost surely, 2115166506001 is an apocalyptic number.
It is an amenable number.
115166506001 is a deficient number, since it is larger than the sum of its proper divisors (7029083119).
115166506001 is a wasteful number, since it uses less digits than its factorization.
115166506001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14143503.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 115166506001 in words is "one hundred fifteen billion, one hundred sixty-six million, five hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •