Base | Representation |
---|---|
bin | 100111000111000010000… |
… | …1001001110111100001111 |
3 | 201000212101101210222012012 |
4 | 1032032010021032330033 |
5 | 1201031423100202203 |
6 | 15233201550531435 |
7 | 1063226663330105 |
oct | 116160411167417 |
9 | 21025341728165 |
10 | 5375221100303 |
11 | 17926891a785a |
12 | 729906806b7b |
13 | 2ccb5bc30582 |
14 | 14823aab7c75 |
15 | 94c4da6dbd8 |
hex | 4e38424ef0f |
5375221100303 has 2 divisors, whose sum is σ = 5375221100304. Its totient is φ = 5375221100302.
The previous prime is 5375221100299. The next prime is 5375221100369. The reversal of 5375221100303 is 3030011225735.
5375221100303 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5375221100303 - 22 = 5375221100299 is a prime.
It is a super-3 number, since 3×53752211003033 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5375221100303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5375221100003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2687610550151 + 2687610550152.
It is an arithmetic number, because the mean of its divisors is an integer number (2687610550152).
Almost surely, 25375221100303 is an apocalyptic number.
5375221100303 is a deficient number, since it is larger than the sum of its proper divisors (1).
5375221100303 is an equidigital number, since it uses as much as digits as its factorization.
5375221100303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 32.
The spelling of 5375221100303 in words is "five trillion, three hundred seventy-five billion, two hundred twenty-one million, one hundred thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •