Base | Representation |
---|---|
bin | 11010010001101011011000… |
… | …000100010010110100001000 |
3 | 120011011210220220112010202210 |
4 | 122101223120010102310020 |
5 | 110121400100324223342 |
6 | 1045441213044425120 |
7 | 33225140011341033 |
oct | 3221533004226410 |
9 | 504153826463683 |
10 | 115564015070472 |
11 | 3390547283a071 |
12 | 10b650b69a81a0 |
13 | 4c63841a0a7c7 |
14 | 207748471801a |
15 | d56142a1a79c |
hex | 691ad8112d08 |
115564015070472 has 32 divisors (see below), whose sum is σ = 288910306900800. Its totient is φ = 38521302460224.
The previous prime is 115564015070467. The next prime is 115564015070479. The reversal of 115564015070472 is 274070510465511.
115564015070472 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (115564015070479) 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, 41276229 + ... + 43986987.
It is an arithmetic number, because the mean of its divisors is an integer number (9028447090650).
Almost surely, 2115564015070472 is an apocalyptic number.
115564015070472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115564015070472 is an abundant number, since it is smaller than the sum of its proper divisors (173346291830328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115564015070472 is a wasteful number, since it uses less digits than its factorization.
115564015070472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4487085 (or 4487081 counting only the distinct ones).
The product of its (nonzero) digits is 1176000, while the sum is 48.
The spelling of 115564015070472 in words is "one hundred fifteen trillion, five hundred sixty-four billion, fifteen million, seventy thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •