Base | Representation |
---|---|
bin | 100000001011100100010… |
… | …110100110011100010111 |
3 | 21211102010100122020012001 |
4 | 200023210112212130113 |
5 | 242213014221220043 |
6 | 4411531250340131 |
7 | 315525436366411 |
oct | 40134426463427 |
9 | 7742110566161 |
10 | 2211444320023 |
11 | 782960737004 |
12 | 2b871428a647 |
13 | 1306cc869433 |
14 | 7906a8619b1 |
15 | 3c7d100b74d |
hex | 202e45a6717 |
2211444320023 has 24 divisors (see below), whose sum is σ = 2384331284160. Its totient is φ = 2049865755840.
The previous prime is 2211444320011. The next prime is 2211444320027. The reversal of 2211444320023 is 3200234441122.
It is not a de Polignac number, because 2211444320023 - 213 = 2211444311831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2211444319973 and 2211444320000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211444320027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62913033 + ... + 62948173.
It is an arithmetic number, because the mean of its divisors is an integer number (99347136840).
Almost surely, 22211444320023 is an apocalyptic number.
2211444320023 is a deficient number, since it is larger than the sum of its proper divisors (172886964137).
2211444320023 is a wasteful number, since it uses less digits than its factorization.
2211444320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38935 (or 38916 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 2211444320023 its reverse (3200234441122), we get a palindrome (5411678761145).
The spelling of 2211444320023 in words is "two trillion, two hundred eleven billion, four hundred forty-four million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.423 sec. • engine limits •