Base | Representation |
---|---|
bin | 1100110100111010001001… |
… | …1000101101101011100011 |
3 | 1211221020120102120020220211 |
4 | 3031032202120231223203 |
5 | 3322031123104122243 |
6 | 45554513045114551 |
7 | 2653626005150101 |
oct | 315164230555343 |
9 | 54836512506824 |
10 | 14103102020323 |
11 | 4548101472548 |
12 | 16b93383b8a57 |
13 | 7b3bbc318174 |
14 | 36a845490c71 |
15 | 196cc262ed9d |
hex | cd3a262dae3 |
14103102020323 has 2 divisors, whose sum is σ = 14103102020324. Its totient is φ = 14103102020322.
The previous prime is 14103102020321. The next prime is 14103102020383. The reversal of 14103102020323 is 32302020130141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14103102020323 - 21 = 14103102020321 is a prime.
Together with 14103102020321, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 14103102020294 and 14103102020303.
It is not a weakly prime, because it can be changed into another prime (14103102020321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7051551010161 + 7051551010162.
It is an arithmetic number, because the mean of its divisors is an integer number (7051551010162).
Almost surely, 214103102020323 is an apocalyptic number.
14103102020323 is a deficient number, since it is larger than the sum of its proper divisors (1).
14103102020323 is an equidigital number, since it uses as much as digits as its factorization.
14103102020323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 14103102020323 its reverse (32302020130141), we get a palindrome (46405122150464).
The spelling of 14103102020323 in words is "fourteen trillion, one hundred three billion, one hundred two million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •