Base | Representation |
---|---|
bin | 11010001011101100001001… |
… | …101010101000011000000111 |
3 | 120002201110210211102012001012 |
4 | 122023230021222220120013 |
5 | 110043124340231442211 |
6 | 1044524201522552435 |
7 | 33153332023020560 |
oct | 3213541152503007 |
9 | 502643724365035 |
10 | 115152530343431 |
11 | 33766a063a4319 |
12 | 10ab93b950871b |
13 | 4c33ab5c096b9 |
14 | 20615ab147167 |
15 | d4a5acc34d8b |
hex | 68bb09aa8607 |
115152530343431 has 16 divisors (see below), whose sum is σ = 132615163410240. Its totient is φ = 97944617422080.
The previous prime is 115152530343391. The next prime is 115152530343457. The reversal of 115152530343431 is 134343035251511.
It is a cyclic number.
It is not a de Polignac number, because 115152530343431 - 230 = 115151456601607 is a prime.
It is a super-2 number, since 2×1151525303434312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115152530345431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68006876 + ... + 69679553.
It is an arithmetic number, because the mean of its divisors is an integer number (8288447713140).
Almost surely, 2115152530343431 is an apocalyptic number.
115152530343431 is a deficient number, since it is larger than the sum of its proper divisors (17462633066809).
115152530343431 is a wasteful number, since it uses less digits than its factorization.
115152530343431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137687354.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 115152530343431 its reverse (134343035251511), we get a palindrome (249495565594942).
The spelling of 115152530343431 in words is "one hundred fifteen trillion, one hundred fifty-two billion, five hundred thirty million, three hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •