Base | Representation |
---|---|
bin | 100110100101101000110… |
… | …0100000100000010101111 |
3 | 200210000021102022210100112 |
4 | 1031023101210010002233 |
5 | 1143343034404111101 |
6 | 15140221413250235 |
7 | 1055110545146555 |
oct | 115132144040257 |
9 | 20700242283315 |
10 | 5303505535151 |
11 | 176522768124a |
12 | 717a3133397b |
13 | 2c6170249a15 |
14 | 1449962c7bd5 |
15 | 92e52a326bb |
hex | 4d2d19040af |
5303505535151 has 8 divisors (see below), whose sum is σ = 5394088076208. Its totient is φ = 5213040408000.
The previous prime is 5303505535043. The next prime is 5303505535171. The reversal of 5303505535151 is 1515355053035.
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 5303505535151 - 230 = 5302431793327 is a prime.
It is a super-2 number, since 2×53035055351512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5303505535099 and 5303505535108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5303505535171) 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, 29262365 + ... + 29443046.
It is an arithmetic number, because the mean of its divisors is an integer number (674261009526).
Almost surely, 25303505535151 is an apocalyptic number.
5303505535151 is a deficient number, since it is larger than the sum of its proper divisors (90582541057).
5303505535151 is a wasteful number, since it uses less digits than its factorization.
5303505535151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58706953.
The product of its (nonzero) digits is 421875, while the sum is 41.
The spelling of 5303505535151 in words is "five trillion, three hundred three billion, five hundred five million, five hundred thirty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •