Base | Representation |
---|---|
bin | 10111011011001010101101… |
… | …111001100110100001001000 |
3 | 111111202210210112100010022121 |
4 | 113123022231321212201020 |
5 | 102000403030244321300 |
6 | 1003035353241301024 |
7 | 30462044163631663 |
oct | 2733125571464110 |
9 | 444683715303277 |
10 | 103022003120200 |
11 | 2a90a427a8a80a |
12 | b67a430494774 |
13 | 4563c1934b0a8 |
14 | 1b6241205c6da |
15 | bd9c8aa5b81a |
hex | 5db2ade66848 |
103022003120200 has 96 divisors (see below), whose sum is σ = 253619239997160. Its totient is φ = 38784248115200.
The previous prime is 103022003120189. The next prime is 103022003120221. The reversal of 103022003120200 is 2021300220301.
It can be written as a sum of positive squares in 12 ways, for example, as 55544198028804 + 47477805091396 = 7452798^2 + 6890414^2 .
It is a super-2 number, since 2×1030220031202002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 353525754 + ... + 353817046.
Almost surely, 2103022003120200 is an apocalyptic number.
103022003120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103022003120200 is an abundant number, since it is smaller than the sum of its proper divisors (150597236876960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103022003120200 is a wasteful number, since it uses less digits than its factorization.
103022003120200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395347 (or 395338 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 103022003120200 its reverse (2021300220301), we get a palindrome (105043303340501).
The spelling of 103022003120200 in words is "one hundred three trillion, twenty-two billion, three million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •