Base | Representation |
---|---|
bin | 100000001010001110011… |
… | …100110110111110000001 |
3 | 21211021101220202200102110 |
4 | 200022032130312332001 |
5 | 242202041244320001 |
6 | 4411132244405533 |
7 | 315444636400155 |
oct | 40121634667601 |
9 | 7737356680373 |
10 | 2210003120001 |
11 | 782291168106 |
12 | 2b83916a68a9 |
13 | 1305300c3b61 |
14 | 78d712a7065 |
15 | 3c7497293d6 |
hex | 2028e736f81 |
2210003120001 has 8 divisors (see below), whose sum is σ = 2946701308864. Its totient is φ = 1473320172240.
The previous prime is 2210003119991. The next prime is 2210003120021. The reversal of 2210003120001 is 1000213000122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2210003120001 - 215 = 2210003087233 is a prime.
It is a super-2 number, since 2×22100031200012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2210003120021) 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 7 ways as a sum of consecutive naturals, for example, 3467530 + ... + 4055091.
It is an arithmetic number, because the mean of its divisors is an integer number (368337663608).
Almost surely, 22210003120001 is an apocalyptic number.
It is an amenable number.
2210003120001 is a deficient number, since it is larger than the sum of its proper divisors (736698188863).
2210003120001 is an equidigital number, since it uses as much as digits as its factorization.
2210003120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7620551.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 2210003120001 its reverse (1000213000122), we get a palindrome (3210216120123).
The spelling of 2210003120001 in words is "two trillion, two hundred ten billion, three million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •