Base | Representation |
---|---|
bin | 10110011001000010… |
… | …10110101010001111 |
3 | 1011000210001202202000 |
4 | 23030201112222033 |
5 | 144104413331343 |
6 | 5304504403343 |
7 | 603616525302 |
oct | 131441265217 |
9 | 34023052660 |
10 | 12021230223 |
11 | 5109742212 |
12 | 23b5a76553 |
13 | 1197688ba2 |
14 | 820786b39 |
15 | 4a5565ed3 |
hex | 2cc856a8f |
12021230223 has 16 divisors (see below), whose sum is σ = 17812341600. Its totient is φ = 8012753280.
The previous prime is 12021230203. The next prime is 12021230261. The reversal of 12021230223 is 32203212021.
12021230223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12021230223 - 28 = 12021229967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12021230196 and 12021230205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021230203) 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 15 ways as a sum of consecutive naturals, for example, 132183 + ... + 203751.
It is an arithmetic number, because the mean of its divisors is an integer number (1113271350).
Almost surely, 212021230223 is an apocalyptic number.
12021230223 is a deficient number, since it is larger than the sum of its proper divisors (5791111377).
12021230223 is an equidigital number, since it uses as much as digits as its factorization.
12021230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77799 (or 77793 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 12021230223 its reverse (32203212021), we get a palindrome (44224442244).
The spelling of 12021230223 in words is "twelve billion, twenty-one million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •