Base | Representation |
---|---|
bin | 1010000110100000110011… |
… | …00101011110111100111111 |
3 | 2220122122012212021101112112 |
4 | 11003100121211132330333 |
5 | 10402423233012031143 |
6 | 115124545404124235 |
7 | 4451623426325231 |
oct | 503203145367477 |
9 | 86578185241475 |
10 | 22214000111423 |
11 | 70949a4a43a3a |
12 | 25a927b83667b |
13 | c51a044b4a73 |
14 | 56b2402d4251 |
15 | 287c8543de18 |
hex | 14341995ef3f |
22214000111423 has 16 divisors (see below), whose sum is σ = 23532458397696. Its totient is φ = 20925107528160.
The previous prime is 22214000111411. The next prime is 22214000111449. The reversal of 22214000111423 is 32411100041222.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22214000111423 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22214000111483) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3404258 + ... + 7484448.
It is an arithmetic number, because the mean of its divisors is an integer number (1470778649856).
Almost surely, 222214000111423 is an apocalyptic number.
22214000111423 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
22214000111423 is a deficient number, since it is larger than the sum of its proper divisors (1318458286273).
22214000111423 is a wasteful number, since it uses less digits than its factorization.
22214000111423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4083814.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 22214000111423 its reverse (32411100041222), we get a palindrome (54625100152645).
The spelling of 22214000111423 in words is "twenty-two trillion, two hundred fourteen billion, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •