Base | Representation |
---|---|
bin | 100110000100110100101… |
… | …1111101000001010000101 |
3 | 200112021101120010000200112 |
4 | 1030021221133220022011 |
5 | 1141214231224041112 |
6 | 15044005253522405 |
7 | 1050034416426542 |
oct | 114115137501205 |
9 | 20467346100615 |
10 | 5233040065157 |
11 | 1738357767733 |
12 | 706246643405 |
13 | 2bc62054a148 |
14 | 1413cd947bc9 |
15 | 911cb629a22 |
hex | 4c2697e8285 |
5233040065157 has 4 divisors (see below), whose sum is σ = 5299281078720. Its totient is φ = 5166799051596.
The previous prime is 5233040065153. The next prime is 5233040065171. The reversal of 5233040065157 is 7515600403325.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5233040065157 - 22 = 5233040065153 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5233040065153) 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, 33120506663 + ... + 33120506820.
It is an arithmetic number, because the mean of its divisors is an integer number (1324820269680).
Almost surely, 25233040065157 is an apocalyptic number.
It is an amenable number.
5233040065157 is a deficient number, since it is larger than the sum of its proper divisors (66241013563).
5233040065157 is an equidigital number, since it uses as much as digits as its factorization.
5233040065157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66241013562.
The product of its (nonzero) digits is 378000, while the sum is 41.
The spelling of 5233040065157 in words is "five trillion, two hundred thirty-three billion, forty million, sixty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •