Base | Representation |
---|---|
bin | 11101001001100010010… |
… | …000010110011001001100 |
3 | 21002111100201002102002210 |
4 | 131021202100112121030 |
5 | 230304323410310012 |
6 | 4132113553350420 |
7 | 264501523244460 |
oct | 35114220263114 |
9 | 7074321072083 |
10 | 2003103213132 |
11 | 7025695a783a |
12 | 28426b268410 |
13 | 116b79445a68 |
14 | 6cd44a824a0 |
15 | 3718a65d23c |
hex | 1d26241664c |
2003103213132 has 24 divisors (see below), whose sum is σ = 5341608568576. Its totient is φ = 572315203728.
The previous prime is 2003103213071. The next prime is 2003103213179. The reversal of 2003103213132 is 2313123013002.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 2003103213099 and 2003103213108.
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 7 ways as a sum of consecutive naturals, for example, 11923233328 + ... + 11923233495.
Almost surely, 22003103213132 is an apocalyptic number.
It is an amenable number.
2003103213132 is an abundant number, since it is smaller than the sum of its proper divisors (3338505355444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003103213132 is a wasteful number, since it uses less digits than its factorization.
2003103213132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23846466837 (or 23846466835 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2003103213132 its reverse (2313123013002), we get a palindrome (4316226226134).
The spelling of 2003103213132 in words is "two trillion, three billion, one hundred three million, two hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •