Base | Representation |
---|---|
bin | 11010010101111111… |
… | …01010000000100011 |
3 | 1100111122202002000001 |
4 | 31022333222000203 |
5 | 212431113244021 |
6 | 10255223440431 |
7 | 1010323251322 |
oct | 151277520043 |
9 | 40448662001 |
10 | 14143103011 |
11 | 5aa845a694 |
12 | 28a85b6117 |
13 | 144516470b |
14 | 9824c80b9 |
15 | 57b99e091 |
hex | 34afea023 |
14143103011 has 2 divisors, whose sum is σ = 14143103012. Its totient is φ = 14143103010.
The previous prime is 14143102951. The next prime is 14143103047. The reversal of 14143103011 is 11030134141.
14143103011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14143103011 - 211 = 14143100963 is a prime.
It is a super-2 number, since 2×141431030112 (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 14143103011.
It is not a weakly prime, because it can be changed into another prime (14143100011) 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, 7071551505 + 7071551506.
It is an arithmetic number, because the mean of its divisors is an integer number (7071551506).
Almost surely, 214143103011 is an apocalyptic number.
14143103011 is a deficient number, since it is larger than the sum of its proper divisors (1).
14143103011 is an equidigital number, since it uses as much as digits as its factorization.
14143103011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 14143103011 its reverse (11030134141), we get a palindrome (25173237152).
The spelling of 14143103011 in words is "fourteen billion, one hundred forty-three million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •