Base | Representation |
---|---|
bin | 1101110111110010111000… |
… | …01110110010000101100000 |
3 | 11000000012012102220111210122 |
4 | 12323321130032302011200 |
5 | 12444241010202141412 |
6 | 144513310311215412 |
7 | 6265604411210246 |
oct | 673713416620540 |
9 | 130005172814718 |
10 | 30504405115232 |
11 | 97a0933491854 |
12 | 3507b5b677568 |
13 | 14037260c1389 |
14 | 7765c765a796 |
15 | 37d752506572 |
hex | 1bbe5c3b2160 |
30504405115232 has 96 divisors (see below), whose sum is σ = 60547950747648. Its totient is φ = 15127566759936.
The previous prime is 30504405115213. The next prime is 30504405115271. The reversal of 30504405115232 is 23251150440503.
It is a junction number, because it is equal to n+sod(n) for n = 30504405115192 and 30504405115201.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 7138871048 + ... + 7138875320.
It is an arithmetic number, because the mean of its divisors is an integer number (630707820288).
Almost surely, 230504405115232 is an apocalyptic number.
30504405115232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30504405115232 is a deficient number, since it is larger than the sum of its proper divisors (30043545632416).
30504405115232 is a wasteful number, since it uses less digits than its factorization.
30504405115232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6932 (or 6924 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 30504405115232 its reverse (23251150440503), we get a palindrome (53755555555735).
The spelling of 30504405115232 in words is "thirty trillion, five hundred four billion, four hundred five million, one hundred fifteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •