Base | Representation |
---|---|
bin | 110101101001011000… |
… | …0100101110110111000 |
3 | 102000100211201121101212 |
4 | 1223102300211312320 |
5 | 3341420001244112 |
6 | 124531405102252 |
7 | 11215614134645 |
oct | 1532260456670 |
9 | 360324647355 |
10 | 115205103032 |
11 | 44949306058 |
12 | 1a3b1b57988 |
13 | ab2c9ab726 |
14 | 580c5d4dcc |
15 | 2ee4065522 |
hex | 1ad2c25db8 |
115205103032 has 32 divisors (see below), whose sum is σ = 216479163600. Its totient is φ = 57477446400.
The previous prime is 115205103031. The next prime is 115205103043. The reversal of 115205103032 is 230301502511.
It is a happy number.
It is a super-2 number, since 2×1152051030322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115205102989 and 115205103007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115205103031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9094319 + ... + 9106977.
Almost surely, 2115205103032 is an apocalyptic number.
It is an amenable number.
115205103032 is a deficient number, since it is larger than the sum of its proper divisors (101274060568).
115205103032 is a wasteful number, since it uses less digits than its factorization.
115205103032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15047 (or 15043 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 115205103032 its reverse (230301502511), we get a palindrome (345506605543).
The spelling of 115205103032 in words is "one hundred fifteen billion, two hundred five million, one hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •