Base | Representation |
---|---|
bin | 10111011111101001110000… |
… | …101000111111110001010001 |
3 | 111112212021100012121101002220 |
4 | 113133221300220333301101 |
5 | 102020430234012033241 |
6 | 1003433124452531253 |
7 | 30523235001460614 |
oct | 2737516050776121 |
9 | 445767305541086 |
10 | 103330213002321 |
11 | 2aa19108476a58 |
12 | b70a107320b29 |
13 | 4586cc70270c6 |
14 | 1b732cd6a017b |
15 | be2cc8d73166 |
hex | 5dfa70a3fc51 |
103330213002321 has 8 divisors (see below), whose sum is σ = 137773688830464. Its totient is φ = 68886772921200.
The previous prime is 103330213002319. The next prime is 103330213002343. The reversal of 103330213002321 is 123200312033301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103330213002321 - 21 = 103330213002319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103330213002291 and 103330213002300.
It is not an unprimeable number, because it can be changed into a prime (103330213002371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1246705 + ... + 14429646.
It is an arithmetic number, because the mean of its divisors is an integer number (17221711103808).
Almost surely, 2103330213002321 is an apocalyptic number.
It is an amenable number.
103330213002321 is a deficient number, since it is larger than the sum of its proper divisors (34443475828143).
103330213002321 is a wasteful number, since it uses less digits than its factorization.
103330213002321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17873511.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 103330213002321 its reverse (123200312033301), we get a palindrome (226530525035622).
The spelling of 103330213002321 in words is "one hundred three trillion, three hundred thirty billion, two hundred thirteen million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •