Base | Representation |
---|---|
bin | 100000000001000000001… |
… | …011111010010111010111 |
3 | 21210022211202112011022111 |
4 | 200001000023322113113 |
5 | 242021301112320043 |
6 | 4402413445011451 |
7 | 314644350314131 |
oct | 40010013722727 |
9 | 7708752464274 |
10 | 2200100120023 |
11 | 77906a185703 |
12 | 2b64890b3b87 |
13 | 12c612539860 |
14 | 786b1d94051 |
15 | 3c36a12c09d |
hex | 200402fa5d7 |
2200100120023 has 16 divisors (see below), whose sum is σ = 2508765962976. Its totient is φ = 1911357665280.
The previous prime is 2200100119957. The next prime is 2200100120033. The reversal of 2200100120023 is 3200210010022.
It is not a de Polignac number, because 2200100120023 - 217 = 2200099988951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2200100119985 and 2200100120012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200100120033) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 14600103 + ... + 14750023.
It is an arithmetic number, because the mean of its divisors is an integer number (156797872686).
Almost surely, 22200100120023 is an apocalyptic number.
2200100120023 is a deficient number, since it is larger than the sum of its proper divisors (308665842953).
2200100120023 is a wasteful number, since it uses less digits than its factorization.
2200100120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216354.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 2200100120023 its reverse (3200210010022), we get a palindrome (5400310130045).
The spelling of 2200100120023 in words is "two trillion, two hundred billion, one hundred million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •