Base | Representation |
---|---|
bin | 100000001010101000011… |
… | …111111011100110010011 |
3 | 21211022112101002020120111 |
4 | 200022220133323212103 |
5 | 242203440133224021 |
6 | 4411243455222151 |
7 | 315461524056445 |
oct | 40125037734623 |
9 | 7738471066514 |
10 | 2210440133011 |
11 | 782495913490 |
12 | 2b8493b17957 |
13 | 13059c7c4536 |
14 | 78db3344495 |
15 | 3c772c9e8e1 |
hex | 202a87fb993 |
2210440133011 has 16 divisors (see below), whose sum is σ = 2538747360000. Its totient is φ = 1903396168800.
The previous prime is 2210440132991. The next prime is 2210440133017. The reversal of 2210440133011 is 1103310440122.
2210440133011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2210440133011 - 27 = 2210440132883 is a prime.
It is a super-2 number, since 2×22104401330112 (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 (2210440133017) 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, 281706 + ... + 2121376.
It is an arithmetic number, because the mean of its divisors is an integer number (158671710000).
Almost surely, 22210440133011 is an apocalyptic number.
2210440133011 is a deficient number, since it is larger than the sum of its proper divisors (328307226989).
2210440133011 is a wasteful number, since it uses less digits than its factorization.
2210440133011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1845450.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2210440133011 its reverse (1103310440122), we get a palindrome (3313750573133).
The spelling of 2210440133011 in words is "two trillion, two hundred ten billion, four hundred forty million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •