Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …100010011110000001010 |
3 | 21020102111021111001202110 |
4 | 131233311010103300022 |
5 | 231443031034404002 |
6 | 4203034022443150 |
7 | 300455462625150 |
oct | 35576504236012 |
9 | 7212437431673 |
10 | 2044221013002 |
11 | 718a49518423 |
12 | 2902255934b6 |
13 | 11a9ccc6bb5c |
14 | 70d258a33d0 |
15 | 38295344e6c |
hex | 1dbf5113c0a |
2044221013002 has 16 divisors (see below), whose sum is σ = 4672505172672. Its totient is φ = 584063146560.
The previous prime is 2044221012997. The next prime is 2044221013007. The reversal of 2044221013002 is 2003101224402.
It is an interprime number because it is at equal distance from previous prime (2044221012997) and next prime (2044221013007).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 2044221013002.
It is not an unprimeable number, because it can be changed into a prime (2044221013007) 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, 24335964399 + ... + 24335964482.
It is an arithmetic number, because the mean of its divisors is an integer number (292031573292).
Almost surely, 22044221013002 is an apocalyptic number.
2044221013002 is an abundant number, since it is smaller than the sum of its proper divisors (2628284159670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2044221013002 is a wasteful number, since it uses less digits than its factorization.
2044221013002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48671928893.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 2044221013002 its reverse (2003101224402), we get a palindrome (4047322237404).
The spelling of 2044221013002 in words is "two trillion, forty-four billion, two hundred twenty-one million, thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •