Base | Representation |
---|---|
bin | 10111011011000001100110… |
… | …010111010010111100011000 |
3 | 111111201212112020112000010221 |
4 | 113123001212113102330120 |
5 | 102000223003012311300 |
6 | 1003031053553245424 |
7 | 30461246445235144 |
oct | 2733014627227430 |
9 | 444655466460127 |
10 | 103012213010200 |
11 | 2a9062637a320a |
12 | b678559863874 |
13 | 4563018c9b6b0 |
14 | 1b61b63b34224 |
15 | bd98b630d31a |
hex | 5db0665d2f18 |
103012213010200 has 48 divisors (see below), whose sum is σ = 257926733351280. Its totient is φ = 38035278648960.
The previous prime is 103012213010171. The next prime is 103012213010233. The reversal of 103012213010200 is 2010312210301.
It is a super-2 number, since 2×1030122130102002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19810038364 + ... + 19810043563.
It is an arithmetic number, because the mean of its divisors is an integer number (5373473611485).
Almost surely, 2103012213010200 is an apocalyptic number.
103012213010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103012213010200 is an abundant number, since it is smaller than the sum of its proper divisors (154914520341080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103012213010200 is a wasteful number, since it uses less digits than its factorization.
103012213010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39620081956 (or 39620081947 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103012213010200 its reverse (2010312210301), we get a palindrome (105022525220501).
The spelling of 103012213010200 in words is "one hundred three trillion, twelve billion, two hundred thirteen million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •