Base | Representation |
---|---|
bin | 11100010101001111… |
… | …101110001101000110 |
3 | 2220112002212210101110 |
4 | 130111033232031012 |
5 | 444300312322042 |
6 | 21550400105450 |
7 | 2124603024033 |
oct | 342517561506 |
9 | 86462783343 |
10 | 30421214022 |
11 | 119a0a893a1 |
12 | 5a90005286 |
13 | 2b3a723574 |
14 | 168837238a |
15 | bd0acd09c |
hex | 7153ee346 |
30421214022 has 8 divisors (see below), whose sum is σ = 60842428056. Its totient is φ = 10140404672.
The previous prime is 30421213997. The next prime is 30421214027. The reversal of 30421214022 is 22041212403.
It is a sphenic number, since it is the product of 3 distinct primes.
30421214022 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 30421214022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30421214027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2535101163 + ... + 2535101174.
It is an arithmetic number, because the mean of its divisors is an integer number (7605303507).
Almost surely, 230421214022 is an apocalyptic number.
30421214022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30421214022 is a wasteful number, since it uses less digits than its factorization.
30421214022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5070202342.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 30421214022 its reverse (22041212403), we get a palindrome (52462426425).
The spelling of 30421214022 in words is "thirty billion, four hundred twenty-one million, two hundred fourteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.688 sec. • engine limits •