Base | Representation |
---|---|
bin | 10111011111001110100100… |
… | …001001001010110101100010 |
3 | 111112202110222011100011102010 |
4 | 113133032210021022311202 |
5 | 102014440433122200302 |
6 | 1003411455132333350 |
7 | 30521152245564210 |
oct | 2737164411126542 |
9 | 445673864304363 |
10 | 103301012303202 |
11 | 2aa0779343656a |
12 | b704518014256 |
13 | 458432242b90c |
14 | 1b71b1d47bcb0 |
15 | be216a4d416c |
hex | 5df3a424ad62 |
103301012303202 has 128 divisors (see below), whose sum is σ = 240964065907200. Its totient is φ = 28910498512896.
The previous prime is 103301012303197. The next prime is 103301012303221. The reversal of 103301012303202 is 202303210103301.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3493543074 + ... + 3493572642.
It is an arithmetic number, because the mean of its divisors is an integer number (1882531764900).
Almost surely, 2103301012303202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103301012303202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120482032953600).
103301012303202 is an abundant number, since it is smaller than the sum of its proper divisors (137663053603998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103301012303202 is a wasteful number, since it uses less digits than its factorization.
103301012303202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32140.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103301012303202 its reverse (202303210103301), we get a palindrome (305604222406503).
The spelling of 103301012303202 in words is "one hundred three trillion, three hundred one billion, twelve million, three hundred three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •