Base | Representation |
---|---|
bin | 1101111011001011000000… |
… | …11100111110000011100100 |
3 | 11000102021201010010110020111 |
4 | 12331211200130332003210 |
5 | 13003141130123411012 |
6 | 145042500322542404 |
7 | 6310153023031246 |
oct | 675454034760344 |
9 | 130367633113214 |
10 | 30620440060132 |
11 | 983606816032a |
12 | 3526543507a04 |
13 | 14116589a09a0 |
14 | 77c074148096 |
15 | 38179433aba7 |
hex | 1bd96073e0e4 |
30620440060132 has 48 divisors (see below), whose sum is σ = 62704518822400. Its totient is φ = 12956801057280.
The previous prime is 30620440060099. The next prime is 30620440060141. The reversal of 30620440060132 is 23106004402603.
It is a super-2 number, since 2×306204400601322 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 30620440060094 and 30620440060103.
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, 499845957 + ... + 499907212.
Almost surely, 230620440060132 is an apocalyptic number.
It is an amenable number.
30620440060132 is an abundant number, since it is smaller than the sum of its proper divisors (32084078762268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30620440060132 is a wasteful number, since it uses less digits than its factorization.
30620440060132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999753236 (or 999753234 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 30620440060132 its reverse (23106004402603), we get a palindrome (53726444462735).
The spelling of 30620440060132 in words is "thirty trillion, six hundred twenty billion, four hundred forty million, sixty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •