Base | Representation |
---|---|
bin | 11010010001001100110100… |
… | …001000111011101100100000 |
3 | 120011001200012222021111000021 |
4 | 122101030310020323230200 |
5 | 110120330344203131000 |
6 | 1045414144533003224 |
7 | 33222565560313165 |
oct | 3221146410735440 |
9 | 504050188244007 |
10 | 115531200052000 |
11 | 338a256359aa97 |
12 | 10b5a879183514 |
13 | 4c6071238a605 |
14 | 2075a5049a06c |
15 | d55371bdc11a |
hex | 69133423bb20 |
115531200052000 has 48 divisors (see below), whose sum is σ = 283860158537592. Its totient is φ = 46212480019200.
The previous prime is 115531200051989. The next prime is 115531200052031. The reversal of 115531200052000 is 250002135511.
It can be written as a sum of positive squares in 4 ways, for example, as 76005686079376 + 39525513972624 = 8718124^2 + 6286932^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14441396007 + ... + 14441404006.
Almost surely, 2115531200052000 is an apocalyptic number.
115531200052000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115531200052000 is an abundant number, since it is smaller than the sum of its proper divisors (168328958485592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115531200052000 is an equidigital number, since it uses as much as digits as its factorization.
115531200052000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28882800038 (or 28882800020 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 115531200052000 its reverse (250002135511), we get a palindrome (115781202187511).
The spelling of 115531200052000 in words is "one hundred fifteen trillion, five hundred thirty-one billion, two hundred million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •