Base | Representation |
---|---|
bin | 101110111101… |
… | …110100111101 |
3 | 212011111201011 |
4 | 232331310331 |
5 | 11122434434 |
6 | 1115515221 |
7 | 206435443 |
oct | 56756475 |
9 | 25144634 |
10 | 12311869 |
11 | 6a4a0a9 |
12 | 4158b11 |
13 | 2720c3b |
14 | 18c6b93 |
15 | 1132e64 |
hex | bbdd3d |
12311869 has 2 divisors, whose sum is σ = 12311870. Its totient is φ = 12311868.
The previous prime is 12311857. The next prime is 12311881. The reversal of 12311869 is 96811321.
It is a balanced prime because it is at equal distance from previous prime (12311857) and next prime (12311881).
It can be written as a sum of positive squares in only one way, i.e., 12180100 + 131769 = 3490^2 + 363^2 .
It is a cyclic number.
It is not a de Polignac number, because 12311869 - 25 = 12311837 is a prime.
It is a super-2 number, since 2×123118692 = 303164236546322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12311869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12311809) 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 as a sum of consecutive naturals, namely, 6155934 + 6155935.
It is an arithmetic number, because the mean of its divisors is an integer number (6155935).
Almost surely, 212311869 is an apocalyptic number.
It is an amenable number.
12311869 is a deficient number, since it is larger than the sum of its proper divisors (1).
12311869 is an equidigital number, since it uses as much as digits as its factorization.
12311869 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 31.
The square root of 12311869 is about 3508.8272969754. The cubic root of 12311869 is about 230.9092489107.
The spelling of 12311869 in words is "twelve million, three hundred eleven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •