Base | Representation |
---|---|
bin | 10111011111100010000111… |
… | …110100101100101011000011 |
3 | 111112211111011122222212020010 |
4 | 113133202013310230223003 |
5 | 102020311440033324303 |
6 | 1003425251013120003 |
7 | 30522524530264536 |
oct | 2737420764545303 |
9 | 445744148885203 |
10 | 103322012011203 |
11 | 2aa1568a1a9a47 |
12 | b7085b8929003 |
13 | 45862bac7083b |
14 | 1b72b52436a1d |
15 | be2998dc4c03 |
hex | 5df887d2cac3 |
103322012011203 has 4 divisors (see below), whose sum is σ = 137762682681608. Its totient is φ = 68881341340800.
The previous prime is 103322012011199. The next prime is 103322012011247. The reversal of 103322012011203 is 302110210223301.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 103322012011203 - 22 = 103322012011199 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103322012011203.
It is not an unprimeable number, because it can be changed into a prime (103322012511203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17220335335198 + ... + 17220335335203.
It is an arithmetic number, because the mean of its divisors is an integer number (34440670670402).
Almost surely, 2103322012011203 is an apocalyptic number.
103322012011203 is a deficient number, since it is larger than the sum of its proper divisors (34440670670405).
103322012011203 is an equidigital number, since it uses as much as digits as its factorization.
103322012011203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34440670670404.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103322012011203 its reverse (302110210223301), we get a palindrome (405432222234504).
The spelling of 103322012011203 in words is "one hundred three trillion, three hundred twenty-two billion, twelve million, eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •