Base | Representation |
---|---|
bin | 10111001111010000001010… |
… | …000010001110011110000010 |
3 | 111101212112100102212122002011 |
4 | 113033100022002032132002 |
5 | 101343444133243200310 |
6 | 1001211301230043134 |
7 | 30345636552231640 |
oct | 2717201202163602 |
9 | 441775312778064 |
10 | 102203210131330 |
11 | 2a624157761360 |
12 | b5678003494aa |
13 | 450494baa4579 |
14 | 1b34939c48190 |
15 | bc381797178a |
hex | 5cf40a08e782 |
102203210131330 has 64 divisors (see below), whose sum is σ = 229388791726080. Its totient is φ = 31851537624000.
The previous prime is 102203210131283. The next prime is 102203210131343. The reversal of 102203210131330 is 33131012302201.
It is a super-2 number, since 2×1022032101313302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2224570 + ... + 14469109.
It is an arithmetic number, because the mean of its divisors is an integer number (3584199870720).
Almost surely, 2102203210131330 is an apocalyptic number.
102203210131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102203210131330 is an abundant number, since it is smaller than the sum of its proper divisors (127185581594750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102203210131330 is a wasteful number, since it uses less digits than its factorization.
102203210131330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16701655.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102203210131330 its reverse (33131012302201), we get a palindrome (135334222433531).
The spelling of 102203210131330 in words is "one hundred two trillion, two hundred three billion, two hundred ten million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •