Base | Representation |
---|---|
bin | 1001111011110000… |
… | …10110100110010111 |
3 | 111202200021002120220 |
4 | 10331320112212113 |
5 | 41410241300403 |
6 | 2241111525423 |
7 | 246106012401 |
oct | 47570264627 |
9 | 14680232526 |
10 | 5333150103 |
11 | 2297473676 |
12 | 104a089873 |
13 | 66cb95428 |
14 | 388423b71 |
15 | 213312953 |
hex | 13de16997 |
5333150103 has 4 divisors (see below), whose sum is σ = 7110866808. Its totient is φ = 3555433400.
The previous prime is 5333150101. The next prime is 5333150117. The reversal of 5333150103 is 3010513335.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5333150103 - 21 = 5333150101 is a prime.
It is a super-2 number, since 2×53331501032 = 56884980042257821218, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5333150101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 888858348 + ... + 888858353.
It is an arithmetic number, because the mean of its divisors is an integer number (1777716702).
Almost surely, 25333150103 is an apocalyptic number.
5333150103 is a deficient number, since it is larger than the sum of its proper divisors (1777716705).
5333150103 is a wasteful number, since it uses less digits than its factorization.
5333150103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1777716704.
The product of its (nonzero) digits is 2025, while the sum is 24.
The square root of 5333150103 is about 73028.4198309124. The cubic root of 5333150103 is about 1747.1409209385.
Adding to 5333150103 its reverse (3010513335), we get a palindrome (8343663438).
The spelling of 5333150103 in words is "five billion, three hundred thirty-three million, one hundred fifty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •