Base | Representation |
---|---|
bin | 10111011011001001111000… |
… | …110110111000000010110000 |
3 | 111111202201111111211011021112 |
4 | 113123021320312320002300 |
5 | 102000344214440304404 |
6 | 1003035125051412452 |
7 | 30462013136560442 |
oct | 2733117066700260 |
9 | 444681444734245 |
10 | 103021113213104 |
11 | 2a90a0107213a9 |
12 | b67a222454128 |
13 | 4563b06b79648 |
14 | 1b62369bac492 |
15 | bd9c3787556e |
hex | 5db278db80b0 |
103021113213104 has 20 divisors (see below), whose sum is σ = 199807709241864. Its totient is φ = 51457833408768.
The previous prime is 103021113213101. The next prime is 103021113213113. The reversal of 103021113213104 is 401312311120301.
It is a super-2 number, since 2×1030211132131042 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103021113213104.
It is not an unprimeable number, because it can be changed into a prime (103021113213101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3295183742 + ... + 3295215005.
Almost surely, 2103021113213104 is an apocalyptic number.
It is an amenable number.
103021113213104 is a deficient number, since it is larger than the sum of its proper divisors (96786596028760).
103021113213104 is an equidigital number, since it uses as much as digits as its factorization.
103021113213104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6590399732 (or 6590399726 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 103021113213104 its reverse (401312311120301), we get a palindrome (504333424333405).
The spelling of 103021113213104 in words is "one hundred three trillion, twenty-one billion, one hundred thirteen million, two hundred thirteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •