Base | Representation |
---|---|
bin | 11110100101101001001… |
… | …001001110000011101110 |
3 | 21102221122012112202222100 |
4 | 132211221021032003232 |
5 | 233414400234013202 |
6 | 4245351415555530 |
7 | 304602410654625 |
oct | 36455111160356 |
9 | 7387565482870 |
10 | 2102003032302 |
11 | 7404aaa04788 |
12 | 29b47068bba6 |
13 | 1232ab040414 |
14 | 73a479586bc |
15 | 39a27ec841c |
hex | 1e96924e0ee |
2102003032302 has 12 divisors (see below), whose sum is σ = 4554339903360. Its totient is φ = 700667677428.
The previous prime is 2102003032289. The next prime is 2102003032309. The reversal of 2102003032302 is 2032303002012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 116777946239 = 2102003032302 / (2 + 1 + 0 + 2 + 0 + 0 + 3 + 0 + 3 + 2 + 3 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102003032309) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 58388973102 + ... + 58388973137.
It is an arithmetic number, because the mean of its divisors is an integer number (379528325280).
Almost surely, 22102003032302 is an apocalyptic number.
2102003032302 is an abundant number, since it is smaller than the sum of its proper divisors (2452336871058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102003032302 is a wasteful number, since it uses less digits than its factorization.
2102003032302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116777946247 (or 116777946244 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 2102003032302 its reverse (2032303002012), we get a palindrome (4134306034314).
The spelling of 2102003032302 in words is "two trillion, one hundred two billion, three million, thirty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •