Base | Representation |
---|---|
bin | 10111101001100000… |
… | …01110111000000111 |
3 | 1012202211011202110122 |
4 | 23310300032320013 |
5 | 202000213003033 |
6 | 5455500012155 |
7 | 626424040106 |
oct | 136460167007 |
9 | 35684152418 |
10 | 12696219143 |
11 | 54257593a3 |
12 | 2563b3105b |
13 | 127447c00a |
14 | 88629003d |
15 | 4e4947a98 |
hex | 2f4c0ee07 |
12696219143 has 2 divisors, whose sum is σ = 12696219144. Its totient is φ = 12696219142.
The previous prime is 12696219139. The next prime is 12696219209. The reversal of 12696219143 is 34191269621.
12696219143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (34191269621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12696219143 - 22 = 12696219139 is a prime.
It is a super-2 number, since 2×126962191432 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12696219094 and 12696219103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12696219103) 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, 6348109571 + 6348109572.
It is an arithmetic number, because the mean of its divisors is an integer number (6348109572).
Almost surely, 212696219143 is an apocalyptic number.
12696219143 is a deficient number, since it is larger than the sum of its proper divisors (1).
12696219143 is an equidigital number, since it uses as much as digits as its factorization.
12696219143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139968, while the sum is 44.
The spelling of 12696219143 in words is "twelve billion, six hundred ninety-six million, two hundred nineteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •