Base | Representation |
---|---|
bin | 11010010000111011010100… |
… | …011110011010011011101000 |
3 | 120010222212201211021011211001 |
4 | 122100323110132122123220 |
5 | 110120023411242413000 |
6 | 1045401400532244344 |
7 | 33221332221600556 |
oct | 3220732436323350 |
9 | 503885654234731 |
10 | 115512415201000 |
11 | 338955a3a84444 |
12 | 10b570b61706b4 |
13 | 4c5ba0a67c56c |
14 | 2074b8b728bd6 |
15 | d54b229a046a |
hex | 690ed479a6e8 |
115512415201000 has 128 divisors (see below), whose sum is σ = 286206094980000. Its totient is φ = 43485948211200.
The previous prime is 115512415200991. The next prime is 115512415201013. The reversal of 115512415201000 is 102514215511.
It can be written as a sum of positive squares in 16 ways, for example, as 15772605732676 + 99739809468324 = 3971474^2 + 9986982^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 115512415201000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1134682102 + ... + 1134783898.
Almost surely, 2115512415201000 is an apocalyptic number.
115512415201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115512415201000 is an abundant number, since it is smaller than the sum of its proper divisors (170693679779000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115512415201000 is a wasteful number, since it uses less digits than its factorization.
115512415201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168584 (or 168570 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 28.
Adding to 115512415201000 its reverse (102514215511), we get a palindrome (115614929416511).
The spelling of 115512415201000 in words is "one hundred fifteen trillion, five hundred twelve billion, four hundred fifteen million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •