Base | Representation |
---|---|
bin | 10110101111101010… |
… | …11000100000000111 |
3 | 1011112000012121010020 |
4 | 23113311120200013 |
5 | 200002010430043 |
6 | 5335404430223 |
7 | 611413020423 |
oct | 132765304007 |
9 | 34460177106 |
10 | 12211030023 |
11 | 51a6898655 |
12 | 2449548373 |
13 | 11c7ab146a |
14 | 83ba71b83 |
15 | 4b7057e83 |
hex | 2d7d58807 |
12211030023 has 8 divisors (see below), whose sum is σ = 16281993600. Its totient is φ = 8140376568.
The previous prime is 12211030021. The next prime is 12211030033. The reversal of 12211030023 is 32003011221.
12211030023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12211030023 - 21 = 12211030021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12211029984 and 12211030011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211030021) 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 7 ways as a sum of consecutive naturals, for example, 39648 + ... + 161226.
It is an arithmetic number, because the mean of its divisors is an integer number (2035249200).
Almost surely, 212211030023 is an apocalyptic number.
12211030023 is a deficient number, since it is larger than the sum of its proper divisors (4070963577).
12211030023 is a wasteful number, since it uses less digits than its factorization.
12211030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155061.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12211030023 its reverse (32003011221), we get a palindrome (44214041244).
The spelling of 12211030023 in words is "twelve billion, two hundred eleven million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •