Base | Representation |
---|---|
bin | 110000000110111000… |
… | …1001000111000000001 |
3 | 100212122212100221102121 |
4 | 1200031301020320001 |
5 | 3143034402402241 |
6 | 115243212044241 |
7 | 10315060133206 |
oct | 1401561107001 |
9 | 325585327377 |
10 | 103310200321 |
11 | 3a8a4a07649 |
12 | 18032463681 |
13 | 9985553863 |
14 | 5000933cad |
15 | 2a49b54ad1 |
hex | 180dc48e01 |
103310200321 has 8 divisors (see below), whose sum is σ = 103668871680. Its totient is φ = 102951902592.
The previous prime is 103310200313. The next prime is 103310200361. The reversal of 103310200321 is 123002013301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103310200321 - 23 = 103310200313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103310200295 and 103310200304.
It is not an unprimeable number, because it can be changed into a prime (103310200361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 466360 + ... + 651238.
It is an arithmetic number, because the mean of its divisors is an integer number (12958608960).
Almost surely, 2103310200321 is an apocalyptic number.
It is an amenable number.
103310200321 is a deficient number, since it is larger than the sum of its proper divisors (358671359).
103310200321 is a wasteful number, since it uses less digits than its factorization.
103310200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186815.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103310200321 its reverse (123002013301), we get a palindrome (226312213622).
The spelling of 103310200321 in words is "one hundred three billion, three hundred ten million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •