Base | Representation |
---|---|
bin | 11010001011101011111101… |
… | …110110011001010110111011 |
3 | 120002201110022000101102121211 |
4 | 122023223331312121112323 |
5 | 110043123434004213201 |
6 | 1044524130121543551 |
7 | 33153324065003500 |
oct | 3213537566312673 |
9 | 502643260342554 |
10 | 115152332101051 |
11 | 33766914501943 |
12 | 10ab9363044bb7 |
13 | 4c33a83b1940b |
14 | 206158caa14a7 |
15 | d4a59a626651 |
hex | 68bafdd995bb |
115152332101051 has 12 divisors (see below), whose sum is σ = 134044903377552. Its totient is φ = 98634069083088.
The previous prime is 115152332101049. The next prime is 115152332101063. The reversal of 115152332101051 is 150101233251511.
It is not a de Polignac number, because 115152332101051 - 21 = 115152332101049 is a prime.
It is a super-2 number, since 2×1151523321010512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115152332101951) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 808616895 + ... + 808759288.
It is an arithmetic number, because the mean of its divisors is an integer number (11170408614796).
Almost surely, 2115152332101051 is an apocalyptic number.
115152332101051 is a deficient number, since it is larger than the sum of its proper divisors (18892571276501).
115152332101051 is a wasteful number, since it uses less digits than its factorization.
115152332101051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1617377650 (or 1617377643 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 115152332101051 its reverse (150101233251511), we get a palindrome (265253565352562).
The spelling of 115152332101051 in words is "one hundred fifteen trillion, one hundred fifty-two billion, three hundred thirty-two million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •