Base | Representation |
---|---|
bin | 1101101010010110001110… |
… | …01000101110011000011110 |
3 | 10221101000112111001110122012 |
4 | 12311023013020232120132 |
5 | 12414203204102040332 |
6 | 143521132251551222 |
7 | 6220326150340523 |
oct | 665130710563036 |
9 | 127330474043565 |
10 | 30042342221342 |
11 | 9632981a88710 |
12 | 34524a775b512 |
13 | 139bc9982a5a9 |
14 | 75c0b2a5714a |
15 | 37170c2223b2 |
hex | 1b52c722e61e |
30042342221342 has 8 divisors (see below), whose sum is σ = 49160196362232. Its totient is φ = 13655610100600.
The previous prime is 30042342221323. The next prime is 30042342221357. The reversal of 30042342221342 is 24312224324003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×300423422213422 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30042342221299 and 30042342221308.
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 3 ways as a sum of consecutive naturals, for example, 682780505009 + ... + 682780505052.
It is an arithmetic number, because the mean of its divisors is an integer number (6145024545279).
Almost surely, 230042342221342 is an apocalyptic number.
30042342221342 is a deficient number, since it is larger than the sum of its proper divisors (19117854140890).
30042342221342 is a wasteful number, since it uses less digits than its factorization.
30042342221342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365561010074.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 30042342221342 its reverse (24312224324003), we get a palindrome (54354566545345).
The spelling of 30042342221342 in words is "thirty trillion, forty-two billion, three hundred forty-two million, two hundred twenty-one thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •