Base | Representation |
---|---|
bin | 100000001010010110000… |
… | …010100011000011010001 |
3 | 21211021201210100020011211 |
4 | 200022112002203003101 |
5 | 242202321343043101 |
6 | 4411153033340121 |
7 | 315451043530522 |
oct | 40122602430321 |
9 | 7737653306154 |
10 | 2210130440401 |
11 | 782347019884 |
12 | 2b8408267641 |
13 | 1305505b1a80 |
14 | 78d8416a849 |
15 | 3c7559c8c51 |
hex | 202960a30d1 |
2210130440401 has 8 divisors (see below), whose sum is σ = 2380155278760. Its totient is φ = 2040107716992.
The previous prime is 2210130440393. The next prime is 2210130440417. The reversal of 2210130440401 is 1040440310122.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 35319564225 + 2174810876176 = 187935^2 + 1474724^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2210130440401 - 23 = 2210130440393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2210130420401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2140935 + ... + 3000643.
It is an arithmetic number, because the mean of its divisors is an integer number (297519409845).
Almost surely, 22210130440401 is an apocalyptic number.
It is an amenable number.
2210130440401 is a deficient number, since it is larger than the sum of its proper divisors (170024838359).
2210130440401 is a wasteful number, since it uses less digits than its factorization.
2210130440401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1057475.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 2210130440401 its reverse (1040440310122), we get a palindrome (3250570750523).
The spelling of 2210130440401 in words is "two trillion, two hundred ten billion, one hundred thirty million, four hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •