Base | Representation |
---|---|
bin | 11010011110010101… |
… | …01011011101001111 |
3 | 1100200112110100201122 |
4 | 31033022223131033 |
5 | 213102023221031 |
6 | 10310204031155 |
7 | 1012133240246 |
oct | 151712533517 |
9 | 40615410648 |
10 | 14213101391 |
11 | 6033a1a495 |
12 | 2907b324bb |
13 | 1456802588 |
14 | 98b90995d |
15 | 582bc947b |
hex | 34f2ab74f |
14213101391 has 2 divisors, whose sum is σ = 14213101392. Its totient is φ = 14213101390.
The previous prime is 14213101339. The next prime is 14213101439. The reversal of 14213101391 is 19310131241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14213101391 - 26 = 14213101327 is a prime.
It is a super-2 number, since 2×142131013912 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14213101391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14213301391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7106550695 + 7106550696.
It is an arithmetic number, because the mean of its divisors is an integer number (7106550696).
Almost surely, 214213101391 is an apocalyptic number.
14213101391 is a deficient number, since it is larger than the sum of its proper divisors (1).
14213101391 is an equidigital number, since it uses as much as digits as its factorization.
14213101391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 14213101391 in words is "fourteen billion, two hundred thirteen million, one hundred one thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •