Base | Representation |
---|---|
bin | 1100110000001100011001… |
… | …1110000101110110101011 |
3 | 1211122111111110200021111010 |
4 | 3030003012132011312223 |
5 | 3314214231333444321 |
6 | 45453355403435003 |
7 | 2645030533124562 |
oct | 314030636056653 |
9 | 54574443607433 |
10 | 14022103031211 |
11 | 4516816673130 |
12 | 16a56b1b25a63 |
13 | 7a938123b342 |
14 | 36695db8cbd9 |
15 | 194b315ce676 |
hex | cc0c6785dab |
14022103031211 has 32 divisors (see below), whose sum is σ = 20470040156160. Its totient is φ = 8467310073600.
The previous prime is 14022103031201. The next prime is 14022103031239. The reversal of 14022103031211 is 11213030122041.
14022103031211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14022103031211 - 29 = 14022103030699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14022103031201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 127810566 + ... + 127920228.
It is an arithmetic number, because the mean of its divisors is an integer number (639688754880).
Almost surely, 214022103031211 is an apocalyptic number.
14022103031211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14022103031211 is a deficient number, since it is larger than the sum of its proper divisors (6447937124949).
14022103031211 is a wasteful number, since it uses less digits than its factorization.
14022103031211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123747.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 14022103031211 its reverse (11213030122041), we get a palindrome (25235133153252).
The spelling of 14022103031211 in words is "fourteen trillion, twenty-two billion, one hundred three million, thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •