Base | Representation |
---|---|
bin | 11010101000110100… |
… | …00010100001101001 |
3 | 1100220122212210022200 |
4 | 31110122002201221 |
5 | 213242024422441 |
6 | 10323024210413 |
7 | 1014251420502 |
oct | 152432024151 |
9 | 40818783280 |
10 | 14301014121 |
11 | 6079605639 |
12 | 2931469a09 |
13 | 146baa3444 |
14 | 999471ba9 |
15 | 58a7927b6 |
hex | 354682869 |
14301014121 has 6 divisors (see below), whose sum is σ = 20657020410. Its totient is φ = 9534009408.
The previous prime is 14301014113. The next prime is 14301014131. The reversal of 14301014121 is 12141010341.
It can be written as a sum of positive squares in only one way, i.e., 9409970025 + 4891044096 = 97005^2 + 69936^2 .
It is not a de Polignac number, because 14301014121 - 23 = 14301014113 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14301014094 and 14301014103.
It is not an unprimeable number, because it can be changed into a prime (14301014131) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 794500776 + ... + 794500793.
It is an arithmetic number, because the mean of its divisors is an integer number (3442836735).
Almost surely, 214301014121 is an apocalyptic number.
It is an amenable number.
14301014121 is a deficient number, since it is larger than the sum of its proper divisors (6356006289).
14301014121 is a wasteful number, since it uses less digits than its factorization.
14301014121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1589001575 (or 1589001572 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 14301014121 its reverse (12141010341), we get a palindrome (26442024462).
The spelling of 14301014121 in words is "fourteen billion, three hundred one million, fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •