Base | Representation |
---|---|
bin | 1101110010011100010111… |
… | …11001100000100110110111 |
3 | 10222100121120020222100210000 |
4 | 12321032023321200212313 |
5 | 12433232411420020010 |
6 | 144253015530002343 |
7 | 6246404532152454 |
oct | 671161371404667 |
9 | 128317506870700 |
10 | 30320521251255 |
11 | 972a951879134 |
12 | 34983a12763b3 |
13 | 13bc29c92b681 |
14 | 76b741adc82b |
15 | 378a8dd687c0 |
hex | 1b938be609b7 |
30320521251255 has 80 divisors (see below), whose sum is σ = 54393447794400. Its totient is φ = 16158720595968.
The previous prime is 30320521251233. The next prime is 30320521251277. The reversal of 30320521251255 is 55215212502303.
30320521251255 is a `hidden beast` number, since 3 + 0 + 3 + 2 + 0 + 521 + 2 + 5 + 125 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (30320521251233) and next prime (30320521251277).
It is not a de Polignac number, because 30320521251255 - 230 = 30319447509431 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 4610080527 + ... + 4610087103.
It is an arithmetic number, because the mean of its divisors is an integer number (679918097430).
Almost surely, 230320521251255 is an apocalyptic number.
30320521251255 is a deficient number, since it is larger than the sum of its proper divisors (24072926543145).
30320521251255 is a wasteful number, since it uses less digits than its factorization.
30320521251255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13470 (or 13461 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
Adding to 30320521251255 its reverse (55215212502303), we get a palindrome (85535733753558).
The spelling of 30320521251255 in words is "thirty trillion, three hundred twenty billion, five hundred twenty-one million, two hundred fifty-one thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •