Base | Representation |
---|---|
bin | 11010001010000100010001… |
… | …111100001101110101101011 |
3 | 120002022210221002102210102201 |
4 | 122022010101330031311223 |
5 | 110034312432001140410 |
6 | 1044401034505041031 |
7 | 33142303136642662 |
oct | 3212042174156553 |
9 | 502283832383381 |
10 | 115041000021355 |
11 | 33723683443621 |
12 | 10a9b872186177 |
13 | 4c26420661a95 |
14 | 205a02aa09dd9 |
15 | d4773160383a |
hex | 68a111f0dd6b |
115041000021355 has 32 divisors (see below), whose sum is σ = 148436602367040. Its totient is φ = 85277266145280.
The previous prime is 115041000021319. The next prime is 115041000021401. The reversal of 115041000021355 is 553120000140511.
It is not a de Polignac number, because 115041000021355 - 217 = 115040999890283 is a prime.
It is a super-2 number, since 2×1150410000213552 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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, 4113631 + ... + 15716359.
It is an arithmetic number, because the mean of its divisors is an integer number (4638643823970).
Almost surely, 2115041000021355 is an apocalyptic number.
115041000021355 is a deficient number, since it is larger than the sum of its proper divisors (33395602345685).
115041000021355 is a wasteful number, since it uses less digits than its factorization.
115041000021355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11604559.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 115041000021355 its reverse (553120000140511), we get a palindrome (668161000161866).
The spelling of 115041000021355 in words is "one hundred fifteen trillion, forty-one billion, twenty-one thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •