Base | Representation |
---|---|
bin | 1001011001110110111… |
… | …01000001101101001111 |
3 | 1010220000210022022222222 |
4 | 10230323131001231033 |
5 | 20243222210341421 |
6 | 404234515125555 |
7 | 32226133533431 |
oct | 4547335015517 |
9 | 1126023268888 |
10 | 323120012111 |
11 | 115041906626 |
12 | 527582a38bb |
13 | 24615a1a350 |
14 | 118d3950651 |
15 | 86122c7cab |
hex | 4b3b741b4f |
323120012111 has 4 divisors (see below), whose sum is σ = 347975397672. Its totient is φ = 298264626552.
The previous prime is 323120012101. The next prime is 323120012123. The reversal of 323120012111 is 111210021323.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 323120012111 - 214 = 323119995727 is a prime.
It is a super-2 number, since 2×3231200121112 (a number of 24 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 323120012111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323120012101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12427692761 + ... + 12427692786.
It is an arithmetic number, because the mean of its divisors is an integer number (86993849418).
Almost surely, 2323120012111 is an apocalyptic number.
323120012111 is a deficient number, since it is larger than the sum of its proper divisors (24855385561).
323120012111 is a wasteful number, since it uses less digits than its factorization.
323120012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24855385560.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 323120012111 its reverse (111210021323), we get a palindrome (434330033434).
The spelling of 323120012111 in words is "three hundred twenty-three billion, one hundred twenty million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •