Base | Representation |
---|---|
bin | 10111011111001111110010… |
… | …001101010001110100001100 |
3 | 111112202121100102202211001220 |
4 | 113133033302031101310030 |
5 | 102020001123413100322 |
6 | 1003412233120003340 |
7 | 30521226561054453 |
oct | 2737176215216414 |
9 | 445677312684056 |
10 | 103302322003212 |
11 | 2aa082a5759572 |
12 | b704822760550 |
13 | 45844a0881a37 |
14 | 1b71c053a5b9a |
15 | be21e548d55c |
hex | 5df3f2351d0c |
103302322003212 has 96 divisors (see below), whose sum is σ = 242562386626560. Its totient is φ = 34217082071040.
The previous prime is 103302322003211. The next prime is 103302322003217. The reversal of 103302322003212 is 212300223203301.
It is not an unprimeable number, because it can be changed into a prime (103302322003211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6020291089 + ... + 6020308247.
It is an arithmetic number, because the mean of its divisors is an integer number (2526691527360).
Almost surely, 2103302322003212 is an apocalyptic number.
103302322003212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103302322003212 is an abundant number, since it is smaller than the sum of its proper divisors (139260064623348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103302322003212 is a wasteful number, since it uses less digits than its factorization.
103302322003212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21623 (or 21621 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 103302322003212 its reverse (212300223203301), we get a palindrome (315602545206513).
The spelling of 103302322003212 in words is "one hundred three trillion, three hundred two billion, three hundred twenty-two million, three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •