Base | Representation |
---|---|
bin | 11010001011100001111001… |
… | …100001101000010111100000 |
3 | 120002200102101122112000122110 |
4 | 122023201321201220113200 |
5 | 110042434314131133100 |
6 | 1044515141322435320 |
7 | 33152462153530203 |
oct | 3213417141502740 |
9 | 502612348460573 |
10 | 115141522130400 |
11 | 337622775669a7 |
12 | 10ab7246962b40 |
13 | 4c32a5039798c |
14 | 2060c4513993a |
15 | d4a1665c2250 |
hex | 68b8798685e0 |
115141522130400 has 144 divisors (see below), whose sum is σ = 376747884592128. Its totient is φ = 30543649728000.
The previous prime is 115141522130399. The next prime is 115141522130423. The reversal of 115141522130400 is 4031225141511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 125132266 + ... + 126049065.
It is an arithmetic number, because the mean of its divisors is an integer number (2616304754112).
Almost surely, 2115141522130400 is an apocalyptic number.
115141522130400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115141522130400 is an abundant number, since it is smaller than the sum of its proper divisors (261606362461728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115141522130400 is a wasteful number, since it uses less digits than its factorization.
115141522130400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251181545 (or 251181532 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 115141522130400 its reverse (4031225141511), we get a palindrome (119172747271911).
The spelling of 115141522130400 in words is "one hundred fifteen trillion, one hundred forty-one billion, five hundred twenty-two million, one hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •