Base | Representation |
---|---|
bin | 110101100100000011… |
… | …1000110001010001100 |
3 | 101222220101120020210220 |
4 | 1223020013012022030 |
5 | 3341033233000012 |
6 | 124501544031340 |
7 | 11211314501523 |
oct | 1531007061214 |
9 | 358811506726 |
10 | 115026453132 |
11 | 44867485808 |
12 | 1a362162550 |
13 | ab0198b226 |
14 | 57d29ad4ba |
15 | 2ed352708c |
hex | 1ac81c628c |
115026453132 has 12 divisors (see below), whose sum is σ = 268395057336. Its totient is φ = 38342151040.
The previous prime is 115026453089. The next prime is 115026453181. The reversal of 115026453132 is 231354620511.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 115026453093 and 115026453102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4792768869 + ... + 4792768892.
It is an arithmetic number, because the mean of its divisors is an integer number (22366254778).
Almost surely, 2115026453132 is an apocalyptic number.
115026453132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115026453132 is an abundant number, since it is smaller than the sum of its proper divisors (153368604204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115026453132 is a wasteful number, since it uses less digits than its factorization.
115026453132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9585537768 (or 9585537766 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 115026453132 in words is "one hundred fifteen billion, twenty-six million, four hundred fifty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •