Base | Representation |
---|---|
bin | 100000001010001110111… |
… | …011000010111010010000 |
3 | 21211021102110122201100002 |
4 | 200022032323002322100 |
5 | 242202100311030412 |
6 | 4411133130145132 |
7 | 315445063555622 |
oct | 40121673027220 |
9 | 7737373581302 |
10 | 2210011033232 |
11 | 782295682472 |
12 | 2b83942821a8 |
13 | 130531934942 |
14 | 78d72366c12 |
15 | 3c74a28ddc2 |
hex | 2028eec2e90 |
2210011033232 has 80 divisors (see below), whose sum is σ = 4542810402240. Its totient is φ = 1039733700096.
The previous prime is 2210011033199. The next prime is 2210011033247. The reversal of 2210011033232 is 2323301100122.
It is an unprimeable number.
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, 8713718 + ... + 8963754.
It is an arithmetic number, because the mean of its divisors is an integer number (56785130028).
Almost surely, 22210011033232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2210011033232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2271405201120).
2210011033232 is an abundant number, since it is smaller than the sum of its proper divisors (2332799369008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210011033232 is a wasteful number, since it uses less digits than its factorization.
2210011033232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250560 (or 250554 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2210011033232 its reverse (2323301100122), we get a palindrome (4533312133354).
The spelling of 2210011033232 in words is "two trillion, two hundred ten billion, eleven million, thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •