Base | Representation |
---|---|
bin | 10111011110000011001111… |
… | …001111100011110101000100 |
3 | 111112110202012101221021021021 |
4 | 113132003033033203311010 |
5 | 102012124312020120400 |
6 | 1003310401254000524 |
7 | 30512260033200133 |
oct | 2736031717436504 |
9 | 445422171837237 |
10 | 103220131020100 |
11 | 2a986459021446 |
12 | b6b0905046144 |
13 | 4579802854813 |
14 | 1b6bc4965991a |
15 | bdeed498471a |
hex | 5de0cf3e3d44 |
103220131020100 has 72 divisors (see below), whose sum is σ = 224492751731808. Its totient is φ = 41194964486400.
The previous prime is 103220131020091. The next prime is 103220131020113. The reversal of 103220131020100 is 1020131022301.
It is a super-2 number, since 2×1032201310201002 (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, 773679999 + ... + 773813401.
It is an arithmetic number, because the mean of its divisors is an integer number (3117954885164).
Almost surely, 2103220131020100 is an apocalyptic number.
103220131020100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103220131020100 is an abundant number, since it is smaller than the sum of its proper divisors (121272620711708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103220131020100 is a wasteful number, since it uses less digits than its factorization.
103220131020100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150805 (or 150798 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103220131020100 its reverse (1020131022301), we get a palindrome (104240262042401).
The spelling of 103220131020100 in words is "one hundred three trillion, two hundred twenty billion, one hundred thirty-one million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •