Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …110110111000000010101110 |
3 | 111111202201111111211011021110 |
4 | 113123021320312320002232 |
5 | 102000344214440304402 |
6 | 1003035125051412450 |
7 | 30462013136560440 |
oct | 2733117066700256 |
9 | 444681444734243 |
10 | 103021113213102 |
11 | 2a90a0107213a7 |
12 | b67a222454126 |
13 | 4563b06b79646 |
14 | 1b62369bac490 |
15 | bd9c3787556c |
hex | 5db278db80ae |
103021113213102 has 32 divisors (see below), whose sum is σ = 235598775922944. Its totient is φ = 29419360560000.
The previous prime is 103021113213101. The next prime is 103021113213113. The reversal of 103021113213102 is 201312311120301.
It is a super-2 number, since 2×1030211132131022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103021113213101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 635051899 + ... + 635214102.
It is an arithmetic number, because the mean of its divisors is an integer number (7362461747592).
Almost surely, 2103021113213102 is an apocalyptic number.
103021113213102 is an abundant number, since it is smaller than the sum of its proper divisors (132577662709842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103021113213102 is a wasteful number, since it uses less digits than its factorization.
103021113213102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270267944.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 103021113213102 its reverse (201312311120301), we get a palindrome (304333424333403).
The spelling of 103021113213102 in words is "one hundred three trillion, twenty-one billion, one hundred thirteen million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •