Base | Representation |
---|---|
bin | 11100001001011100… |
… | …000001011110111001 |
3 | 2220000022010011200000 |
4 | 130021130001132321 |
5 | 443344104041441 |
6 | 21515002103213 |
7 | 2116646133336 |
oct | 341134013671 |
9 | 86008104600 |
10 | 30223112121 |
11 | 118aa182514 |
12 | 5a357aab09 |
13 | 2b086821c7 |
14 | 1669d2598d |
15 | bbd4eb2b6 |
hex | 7097017b9 |
30223112121 has 12 divisors (see below), whose sum is σ = 45272481072. Its totient is φ = 20148741252.
The previous prime is 30223112111. The next prime is 30223112177. The reversal of 30223112121 is 12121132203.
30223112121 is a `hidden beast` number, since 302 + 231 + 12 + 121 = 666.
It is not a de Polignac number, because 30223112121 - 25 = 30223112089 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30223112094 and 30223112103.
It is not an unprimeable number, because it can be changed into a prime (30223112111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 62187231 + ... + 62187716.
It is an arithmetic number, because the mean of its divisors is an integer number (3772706756).
Almost surely, 230223112121 is an apocalyptic number.
It is an amenable number.
30223112121 is a deficient number, since it is larger than the sum of its proper divisors (15049368951).
30223112121 is an equidigital number, since it uses as much as digits as its factorization.
30223112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124374962 (or 124374950 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30223112121 its reverse (12121132203), we get a palindrome (42344244324).
The spelling of 30223112121 in words is "thirty billion, two hundred twenty-three million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •