Base | Representation |
---|---|
bin | 1100111011111001100111… |
… | …1110100100101010011101 |
3 | 1212100201121122210121000210 |
4 | 3032332121332210222131 |
5 | 3331013123312043310 |
6 | 50130020155043033 |
7 | 2665410436342230 |
oct | 316763176445235 |
9 | 55321548717023 |
10 | 14223220034205 |
11 | 4594040a021a6 |
12 | 171867b740479 |
13 | 7c2322ab2420 |
14 | 37259c357417 |
15 | 199ea2b47820 |
hex | cef99fa4a9d |
14223220034205 has 128 divisors (see below), whose sum is σ = 28671131123712. Its totient is φ = 5860065512448.
The previous prime is 14223220034203. The next prime is 14223220034209. The reversal of 14223220034205 is 50243002232241.
It is not a de Polignac number, because 14223220034205 - 21 = 14223220034203 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14223220034201) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 158020644 + ... + 158110626.
It is an arithmetic number, because the mean of its divisors is an integer number (223993211904).
Almost surely, 214223220034205 is an apocalyptic number.
14223220034205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14223220034205 is an abundant number, since it is smaller than the sum of its proper divisors (14447911089507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14223220034205 is a wasteful number, since it uses less digits than its factorization.
14223220034205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92747.
The product of its (nonzero) digits is 23040, while the sum is 30.
Adding to 14223220034205 its reverse (50243002232241), we get a palindrome (64466222266446).
The spelling of 14223220034205 in words is "fourteen trillion, two hundred twenty-three billion, two hundred twenty million, thirty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •