Base | Representation |
---|---|
bin | 10111001101110011001000… |
… | …000111101100100011100100 |
3 | 111101111222111221000021102101 |
4 | 113031303020013230203210 |
5 | 101340330044411134340 |
6 | 1001053341230221444 |
7 | 30335502311266060 |
oct | 2715631007544344 |
9 | 441458457007371 |
10 | 102103320021220 |
11 | 2a595858362151 |
12 | b550383354884 |
13 | 44c83bcc8c03b |
14 | 1b2db81630aa0 |
15 | bc0e1d1e1c9a |
hex | 5cdcc81ec8e4 |
102103320021220 has 48 divisors (see below), whose sum is σ = 245052870910848. Its totient is φ = 35006152170240.
The previous prime is 102103320021211. The next prime is 102103320021271. The reversal of 102103320021220 is 22120023301201.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 249426 + ... + 14292265.
It is an arithmetic number, because the mean of its divisors is an integer number (5105268143976).
Almost surely, 2102103320021220 is an apocalyptic number.
102103320021220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102103320021220 is an abundant number, since it is smaller than the sum of its proper divisors (142949550889628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102103320021220 is a wasteful number, since it uses less digits than its factorization.
102103320021220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14591860 (or 14591858 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102103320021220 its reverse (22120023301201), we get a palindrome (124223343322421).
The spelling of 102103320021220 in words is "one hundred two trillion, one hundred three billion, three hundred twenty million, twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •