Base | Representation |
---|---|
bin | 1100110101111101010001… |
… | …1010100001001010000101 |
3 | 1211222222002012212121110220 |
4 | 3031133110122201022011 |
5 | 3322330024013121201 |
6 | 50011053055134553 |
7 | 2655134355641421 |
oct | 315372432411205 |
9 | 54888065777426 |
10 | 14121121223301 |
11 | 4554808880434 |
12 | 1700926b14459 |
13 | 7b5801510151 |
14 | 36b674679b81 |
15 | 1974c952d036 |
hex | cd7d46a1285 |
14121121223301 has 4 divisors (see below), whose sum is σ = 18828161631072. Its totient is φ = 9414080815532.
The previous prime is 14121121223239. The next prime is 14121121223303. The reversal of 14121121223301 is 10332212112141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14121121223301 - 223 = 14121112834693 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14121121223303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2353520203881 + ... + 2353520203886.
It is an arithmetic number, because the mean of its divisors is an integer number (4707040407768).
Almost surely, 214121121223301 is an apocalyptic number.
It is an amenable number.
14121121223301 is a deficient number, since it is larger than the sum of its proper divisors (4707040407771).
14121121223301 is an equidigital number, since it uses as much as digits as its factorization.
14121121223301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4707040407770.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 14121121223301 its reverse (10332212112141), we get a palindrome (24453333335442).
The spelling of 14121121223301 in words is "fourteen trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •