Base | Representation |
---|---|
bin | 110101110001000110… |
… | …0101110101110000101 |
3 | 102001000220010221000221 |
4 | 1223202030232232011 |
5 | 3342432304400410 |
6 | 125013221104341 |
7 | 11225210655535 |
oct | 1534214565605 |
9 | 361026127027 |
10 | 115464137605 |
11 | 44a7154a613 |
12 | 1a4648580b1 |
13 | ab7156541b |
14 | 5834b834c5 |
15 | 300bb814da |
hex | 1ae232eb85 |
115464137605 has 16 divisors (see below), whose sum is σ = 138850905600. Its totient is φ = 92175511680.
The previous prime is 115464137597. The next prime is 115464137641. The reversal of 115464137605 is 506731464511.
It is not a de Polignac number, because 115464137605 - 23 = 115464137597 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6582036 + ... + 6599554.
It is an arithmetic number, because the mean of its divisors is an integer number (8678181600).
Almost surely, 2115464137605 is an apocalyptic number.
It is an amenable number.
115464137605 is a deficient number, since it is larger than the sum of its proper divisors (23386767995).
115464137605 is a wasteful number, since it uses less digits than its factorization.
115464137605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20244.
The product of its (nonzero) digits is 302400, while the sum is 43.
The spelling of 115464137605 in words is "one hundred fifteen billion, four hundred sixty-four million, one hundred thirty-seven thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •