Base | Representation |
---|---|
bin | 100100100111110010000… |
… | …1101111010001101001111 |
3 | 122211011122211200021001021 |
4 | 1021033210031322031033 |
5 | 1124431031300231101 |
6 | 14412123025455011 |
7 | 1026432161214316 |
oct | 111174415721517 |
9 | 18734584607037 |
10 | 5033235555151 |
11 | 1670646289011 |
12 | 6935844a1467 |
13 | 2a682a89652b |
14 | 1358777d327d |
15 | 8add541d5a1 |
hex | 493e437a34f |
5033235555151 has 4 divisors (see below), whose sum is σ = 5033322111400. Its totient is φ = 5033148998904.
The previous prime is 5033235555137. The next prime is 5033235555157. The reversal of 5033235555151 is 1515555323305.
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 5033235555151 - 25 = 5033235555119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5033235555098 and 5033235555107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5033235555157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43190841 + ... + 43307218.
It is an arithmetic number, because the mean of its divisors is an integer number (1258330527850).
Almost surely, 25033235555151 is an apocalyptic number.
5033235555151 is a deficient number, since it is larger than the sum of its proper divisors (86556249).
5033235555151 is an equidigital number, since it uses as much as digits as its factorization.
5033235555151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86556248.
The product of its (nonzero) digits is 843750, while the sum is 43.
The spelling of 5033235555151 in words is "five trillion, thirty-three billion, two hundred thirty-five million, five hundred fifty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •