Base | Representation |
---|---|
bin | 10110110001111101… |
… | …11110101110011101 |
3 | 1011120100111210020200 |
4 | 23120332332232131 |
5 | 200021430314401 |
6 | 5341334134113 |
7 | 612036013443 |
oct | 133076765635 |
9 | 34510453220 |
10 | 12230323101 |
11 | 5206775847 |
12 | 2453ab1339 |
13 | 11cbaa7b99 |
14 | 840454b93 |
15 | 4b8ab9686 |
hex | 2d8fbeb9d |
12230323101 has 12 divisors (see below), whose sum is σ = 18143482812. Its totient is φ = 7933182336.
The previous prime is 12230323087. The next prime is 12230323111. The reversal of 12230323101 is 10132303221.
12230323101 is a `hidden beast` number, since 12 + 230 + 323 + 101 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6791408100 + 5438915001 = 82410^2 + 73749^2 .
It is not a de Polignac number, because 12230323101 - 25 = 12230323069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230323111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18363516 + ... + 18364181.
It is an arithmetic number, because the mean of its divisors is an integer number (1511956901).
Almost surely, 212230323101 is an apocalyptic number.
It is an amenable number.
12230323101 is a deficient number, since it is larger than the sum of its proper divisors (5913159711).
12230323101 is a wasteful number, since it uses less digits than its factorization.
12230323101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36727740 (or 36727737 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 12230323101 its reverse (10132303221), we get a palindrome (22362626322).
The spelling of 12230323101 in words is "twelve billion, two hundred thirty million, three hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •