Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …001100000111001100111010 |
3 | 111111202201110201201121220120 |
4 | 113123021320030013030322 |
5 | 102000344204103044002 |
6 | 1003035124011234110 |
7 | 30462012642361101 |
oct | 2733117014071472 |
9 | 444681421647816 |
10 | 103021102003002 |
11 | 2a90a005365057 |
12 | b67a21a748936 |
13 | 4563b04753051 |
14 | 1b623684d1038 |
15 | bd9c368adcbc |
hex | 5db27830733a |
103021102003002 has 64 divisors (see below), whose sum is σ = 221415956987904. Its totient is φ = 31839071962880.
The previous prime is 103021102002997. The next prime is 103021102003007. The reversal of 103021102003002 is 200300201120301.
It is an interprime number because it is at equal distance from previous prime (103021102002997) and next prime (103021102003007).
It is a super-2 number, since 2×1030211020030022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103021102003007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3041143 + ... + 14672789.
It is an arithmetic number, because the mean of its divisors is an integer number (3459624327936).
Almost surely, 2103021102003002 is an apocalyptic number.
103021102003002 is an abundant number, since it is smaller than the sum of its proper divisors (118394854984902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103021102003002 is a wasteful number, since it uses less digits than its factorization.
103021102003002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11632963.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 103021102003002 its reverse (200300201120301), we get a palindrome (303321303123303).
The spelling of 103021102003002 in words is "one hundred three trillion, twenty-one billion, one hundred two million, three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •