Base | Representation |
---|---|
bin | 11100010101001111… |
… | …010010101010100111 |
3 | 2220112002200001122201 |
4 | 130111033102222213 |
5 | 444300300214343 |
6 | 21550353435331 |
7 | 2124602044132 |
oct | 342517225247 |
9 | 86462601581 |
10 | 30421101223 |
11 | 119a0a11677 |
12 | 5a8bb6bb47 |
13 | 2b3a6b4116 |
14 | 1688343219 |
15 | bd0aa994d |
hex | 7153d2aa7 |
30421101223 has 8 divisors (see below), whose sum is σ = 30594062592. Its totient is φ = 30248624736.
The previous prime is 30421101203. The next prime is 30421101287. The reversal of 30421101223 is 32210112403.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30421101223 - 221 = 30419004071 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30421101223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30421101203) 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 7 ways as a sum of consecutive naturals, for example, 4986 + ... + 246712.
It is an arithmetic number, because the mean of its divisors is an integer number (3824257824).
Almost surely, 230421101223 is an apocalyptic number.
30421101223 is a deficient number, since it is larger than the sum of its proper divisors (172961369).
30421101223 is a wasteful number, since it uses less digits than its factorization.
30421101223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242441.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 30421101223 its reverse (32210112403), we get a palindrome (62631213626).
The spelling of 30421101223 in words is "thirty billion, four hundred twenty-one million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •