Base | Representation |
---|---|
bin | 110101100011010101… |
… | …1100011100011111000 |
3 | 101222211201102002100210 |
4 | 1223012223203203320 |
5 | 3341011112100222 |
6 | 124455325431120 |
7 | 11210603515122 |
oct | 1530653434370 |
9 | 358751362323 |
10 | 115002456312 |
11 | 44854985627 |
12 | 1a35610b4a0 |
13 | aac9a08823 |
14 | 57cd724212 |
15 | 2ed1386d0c |
hex | 1ac6ae38f8 |
115002456312 has 16 divisors (see below), whose sum is σ = 287506140840. Its totient is φ = 38334152096.
The previous prime is 115002456269. The next prime is 115002456313. The reversal of 115002456312 is 213654200511.
115002456312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 115002456312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115002456313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2395884483 + ... + 2395884530.
Almost surely, 2115002456312 is an apocalyptic number.
115002456312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115002456312 is an abundant number, since it is smaller than the sum of its proper divisors (172503684528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115002456312 is a wasteful number, since it uses less digits than its factorization.
115002456312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4791769022 (or 4791769018 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 115002456312 its reverse (213654200511), we get a palindrome (328656656823).
The spelling of 115002456312 in words is "one hundred fifteen billion, two million, four hundred fifty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •