Base | Representation |
---|---|
bin | 10111011111001101111001… |
… | …110111110011111111110101 |
3 | 111112202102010201212102102011 |
4 | 113133031321313303333311 |
5 | 102014433010044011013 |
6 | 1003411300520044221 |
7 | 30521125544544013 |
oct | 2737157167637765 |
9 | 445672121772364 |
10 | 103300303110133 |
11 | 2aa0745a088298 |
12 | b70435a603671 |
13 | 458423b52104c |
14 | 1b71a931cd8b3 |
15 | be21280e7c3d |
hex | 5df379df3ff5 |
103300303110133 has 8 divisors (see below), whose sum is σ = 105054349656960. Its totient is φ = 101546363028480.
The previous prime is 103300303110101. The next prime is 103300303110143. The reversal of 103300303110133 is 331011303003301.
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 103300303110133 - 25 = 103300303110101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103300303110143) 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, 24658060 + ... + 28541557.
It is an arithmetic number, because the mean of its divisors is an integer number (13131793707120).
Almost surely, 2103300303110133 is an apocalyptic number.
It is an amenable number.
103300303110133 is a deficient number, since it is larger than the sum of its proper divisors (1754046546827).
103300303110133 is an equidigital number, since it uses as much as digits as its factorization.
103300303110133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53232587.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 103300303110133 its reverse (331011303003301), we get a palindrome (434311606113434).
The spelling of 103300303110133 in words is "one hundred three trillion, three hundred billion, three hundred three million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •