Base | Representation |
---|---|
bin | 1001011010101010… |
… | …10100010100111111 |
3 | 111001022212112211002 |
4 | 10231111110110333 |
5 | 40323203432203 |
6 | 2153353320515 |
7 | 236165204255 |
oct | 45525242477 |
9 | 14038775732 |
10 | 5055530303 |
11 | 216479581a |
12 | b9110613b |
13 | 627502265 |
14 | 35d5d85d5 |
15 | 1e8c74d88 |
hex | 12d55453f |
5055530303 has 4 divisors (see below), whose sum is σ = 5055672600. Its totient is φ = 5055388008.
The previous prime is 5055530281. The next prime is 5055530309. The reversal of 5055530303 is 3030355505.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5055530303 - 212 = 5055526207 is a prime.
It is a super-3 number, since 3×50555303033 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055530309) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31748 + ... + 105446.
It is an arithmetic number, because the mean of its divisors is an integer number (1263918150).
Almost surely, 25055530303 is an apocalyptic number.
5055530303 is a deficient number, since it is larger than the sum of its proper divisors (142297).
5055530303 is an equidigital number, since it uses as much as digits as its factorization.
5055530303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142296.
The product of its (nonzero) digits is 16875, while the sum is 29.
The square root of 5055530303 is about 71102.2524467404. The cubic root of 5055530303 is about 1716.2830205655.
Adding to 5055530303 its reverse (3030355505), we get a palindrome (8085885808).
The spelling of 5055530303 in words is "five billion, fifty-five million, five hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •