Base | Representation |
---|---|
bin | 11010001100110110010111… |
… | …110111100010101111101000 |
3 | 120010000002111220220211021110 |
4 | 122030312113313202233220 |
5 | 110100431044212113412 |
6 | 1045024541550510320 |
7 | 33162152653506264 |
oct | 3214662767425750 |
9 | 503002456824243 |
10 | 115232225504232 |
11 | 33797792221181 |
12 | 10b1093b2053a0 |
13 | 4c3b476b3ab95 |
14 | 20653ab60d0a4 |
15 | d4c6c458ad3c |
hex | 68cd97de2be8 |
115232225504232 has 64 divisors (see below), whose sum is σ = 290065617360000. Its totient is φ = 38146159805184.
The previous prime is 115232225504197. The next prime is 115232225504237. The reversal of 115232225504232 is 232405522232511.
It is not an unprimeable number, because it can be changed into a prime (115232225504237) 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, 17242494 + ... + 22973202.
It is an arithmetic number, because the mean of its divisors is an integer number (4532275271250).
Almost surely, 2115232225504232 is an apocalyptic number.
115232225504232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115232225504232 is an abundant number, since it is smaller than the sum of its proper divisors (174833391855768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115232225504232 is a wasteful number, since it uses less digits than its factorization.
115232225504232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5736490 (or 5736486 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 39.
Adding to 115232225504232 its reverse (232405522232511), we get a palindrome (347637747736743).
The spelling of 115232225504232 in words is "one hundred fifteen trillion, two hundred thirty-two billion, two hundred twenty-five million, five hundred four thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •