Base | Representation |
---|---|
bin | 1101111011001110110000… |
… | …10110001101111111110110 |
3 | 11000102110220022010001022010 |
4 | 12331213120112031333312 |
5 | 13003204240044300332 |
6 | 145043432100145050 |
7 | 6310253616333552 |
oct | 675473026157766 |
9 | 130373808101263 |
10 | 30622451556342 |
11 | 98369aa63a198 |
12 | 3526a05098186 |
13 | 14118b9641929 |
14 | 77c1c5356862 |
15 | 381860c1e9cc |
hex | 1bd9d858dff6 |
30622451556342 has 64 divisors (see below), whose sum is σ = 63429112454400. Its totient is φ = 9849224267904.
The previous prime is 30622451556341. The next prime is 30622451556371. The reversal of 30622451556342 is 24365515422603.
It is a junction number, because it is equal to n+sod(n) for n = 30622451556291 and 30622451556300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30622451556341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 324353488 + ... + 324447884.
It is an arithmetic number, because the mean of its divisors is an integer number (991079882100).
Almost surely, 230622451556342 is an apocalyptic number.
30622451556342 is an abundant number, since it is smaller than the sum of its proper divisors (32806660898058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30622451556342 is a wasteful number, since it uses less digits than its factorization.
30622451556342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109677.
The product of its (nonzero) digits is 5184000, while the sum is 48.
Adding to 30622451556342 its reverse (24365515422603), we get a palindrome (54987966978945).
The spelling of 30622451556342 in words is "thirty trillion, six hundred twenty-two billion, four hundred fifty-one million, five hundred fifty-six thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •