Base | Representation |
---|---|
bin | 11100011100101000… |
… | …011000101111010110 |
3 | 2220211202000212201200 |
4 | 130130220120233112 |
5 | 1000024022321324 |
6 | 22010543533330 |
7 | 2130636144420 |
oct | 343450305726 |
9 | 86752025650 |
10 | 30545120214 |
11 | 11a54a18a04 |
12 | 5b055ba246 |
13 | 2b5a2b743b |
14 | 169a9c7810 |
15 | bdb905ec9 |
hex | 71ca18bd6 |
30545120214 has 96 divisors (see below), whose sum is σ = 79665231360. Its totient is φ = 8262777600.
The previous prime is 30545120197. The next prime is 30545120257. The reversal of 30545120214 is 41202154503.
30545120214 is a `hidden beast` number, since 3 + 0 + 5 + 451 + 202 + 1 + 4 = 666.
It is a super-2 number, since 2×305451202142 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5529774 + ... + 5535294.
It is an arithmetic number, because the mean of its divisors is an integer number (829846160).
Almost surely, 230545120214 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30545120214, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39832615680).
30545120214 is an abundant number, since it is smaller than the sum of its proper divisors (49120111146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30545120214 is a wasteful number, since it uses less digits than its factorization.
30545120214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7866 (or 7863 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 30545120214 its reverse (41202154503), we get a palindrome (71747274717).
The spelling of 30545120214 in words is "thirty billion, five hundred forty-five million, one hundred twenty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •