Base | Representation |
---|---|
bin | 1101001000101001100000… |
… | …0111110001000110100000 |
3 | 1220010122220222212111022212 |
4 | 3102022120013301012200 |
5 | 3343110142422101422 |
6 | 50414400410221252 |
7 | 3020262656253422 |
oct | 322123007610640 |
9 | 56118828774285 |
10 | 14442232222112 |
11 | 4668a09643592 |
12 | 1753002424828 |
13 | 809b86c48716 |
14 | 37d017466812 |
15 | 1a0a202629e2 |
hex | d22981f11a0 |
14442232222112 has 12 divisors (see below), whose sum is σ = 28433144687346. Its totient is φ = 7221116111040.
The previous prime is 14442232222109. The next prime is 14442232222153. The reversal of 14442232222112 is 21122223224441.
It can be written as a sum of positive squares in only one way, i.e., 12112933572496 + 2329298649616 = 3480364^2 + 1526204^2 .
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 451319756941 = 14442232222112 / (1 + 4 + 4 + 4 + 2 + 2 + 3 + 2 + 2 + 2 + 2 + 1 + 1 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 225659878439 + ... + 225659878502.
Almost surely, 214442232222112 is an apocalyptic number.
It is an amenable number.
14442232222112 is a deficient number, since it is larger than the sum of its proper divisors (13990912465234).
14442232222112 is an equidigital number, since it uses as much as digits as its factorization.
14442232222112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451319756951 (or 451319756943 counting only the distinct ones).
The product of its digits is 24576, while the sum is 32.
Adding to 14442232222112 its reverse (21122223224441), we get a palindrome (35564455446553).
The spelling of 14442232222112 in words is "fourteen trillion, four hundred forty-two billion, two hundred thirty-two million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •