Base | Representation |
---|---|
bin | 10111011111001111110010… |
… | …001101010001110100000001 |
3 | 111112202121100102202211001111 |
4 | 113133033302031101310001 |
5 | 102020001123413100301 |
6 | 1003412233120003321 |
7 | 30521226561054436 |
oct | 2737176215216401 |
9 | 445677312684044 |
10 | 103302322003201 |
11 | 2aa082a5759562 |
12 | b704822760541 |
13 | 45844a0881a29 |
14 | 1b71c053a5b8d |
15 | be21e548d551 |
hex | 5df3f2351d01 |
103302322003201 has 4 divisors (see below), whose sum is σ = 107793727307712. Its totient is φ = 98810916698692.
The previous prime is 103302322003193. The next prime is 103302322003211. The reversal of 103302322003201 is 102300223203301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103302322003201 - 23 = 103302322003193 is a prime.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 2245702652221 + ... + 2245702652266.
It is an arithmetic number, because the mean of its divisors is an integer number (26948431826928).
Almost surely, 2103302322003201 is an apocalyptic number.
It is an amenable number.
103302322003201 is a deficient number, since it is larger than the sum of its proper divisors (4491405304511).
103302322003201 is an equidigital number, since it uses as much as digits as its factorization.
103302322003201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4491405304510.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 103302322003201 its reverse (102300223203301), we get a palindrome (205602545206502).
The spelling of 103302322003201 in words is "one hundred three trillion, three hundred two billion, three hundred twenty-two million, three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •