Base | Representation |
---|---|
bin | 10110111100110001… |
… | …11110010010000111 |
3 | 1011210200011211021022 |
4 | 23132120332102013 |
5 | 200213140214421 |
6 | 5354334141355 |
7 | 614216653115 |
oct | 133630762207 |
9 | 34720154238 |
10 | 12321023111 |
11 | 5252995031 |
12 | 247a35185b |
13 | 1214813627 |
14 | 84c504ab5 |
15 | 4c1a337ab |
hex | 2de63e487 |
12321023111 has 12 divisors (see below), whose sum is σ = 12944845200. Its totient is φ = 11726003520.
The previous prime is 12321023093. The next prime is 12321023123. The reversal of 12321023111 is 11132012321.
It is a de Polignac number, because none of the positive numbers 2k-12321023111 is a prime.
It is a super-2 number, since 2×123210231112 (a number of 21 digits) contains 22 as substring.
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 12321023111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12321023311) 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 11 ways as a sum of consecutive naturals, for example, 46751 + ... + 163791.
It is an arithmetic number, because the mean of its divisors is an integer number (1078737100).
Almost surely, 212321023111 is an apocalyptic number.
12321023111 is a deficient number, since it is larger than the sum of its proper divisors (623822089).
12321023111 is a wasteful number, since it uses less digits than its factorization.
12321023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117286 (or 117263 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12321023111 its reverse (11132012321), we get a palindrome (23453035432).
The spelling of 12321023111 in words is "twelve billion, three hundred twenty-one million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •