Base | Representation |
---|---|
bin | 11010001100011010010110… |
… | …111101000110110100001100 |
3 | 120002220012212120220221022201 |
4 | 122030122112331012310030 |
5 | 110044432443211230122 |
6 | 1045003045054051244 |
7 | 33160036362121360 |
oct | 3214322675066414 |
9 | 502805776827281 |
10 | 115202145414412 |
11 | 33785a56855511 |
12 | 10b06b454a9b24 |
13 | 4c38691cb3874 |
14 | 2063b566b72a0 |
15 | d4ba138e1a27 |
hex | 68c696f46d0c |
115202145414412 has 96 divisors (see below), whose sum is σ = 237536796672000. Its totient is φ = 47867476608000.
The previous prime is 115202145414409. The next prime is 115202145414413. The reversal of 115202145414412 is 214414541202511.
It is not an unprimeable number, because it can be changed into a prime (115202145414413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 514185589 + ... + 514409587.
It is an arithmetic number, because the mean of its divisors is an integer number (2474341632000).
Almost surely, 2115202145414412 is an apocalyptic number.
It is an amenable number.
115202145414412 is an abundant number, since it is smaller than the sum of its proper divisors (122334651257588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115202145414412 is a wasteful number, since it uses less digits than its factorization.
115202145414412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228383 (or 228381 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 37.
Adding to 115202145414412 its reverse (214414541202511), we get a palindrome (329616686616923).
The spelling of 115202145414412 in words is "one hundred fifteen trillion, two hundred two billion, one hundred forty-five million, four hundred fourteen thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •