Base | Representation |
---|---|
bin | 1000111010101101110… |
… | …1100010100000010111 |
3 | 112122102210202220100120 |
4 | 2032223131202200113 |
5 | 10002223312042212 |
6 | 154213534243023 |
7 | 14032310534142 |
oct | 2165335424027 |
9 | 478383686316 |
10 | 153200502807 |
11 | 59a767652a0 |
12 | 25836656473 |
13 | 115a6665ac1 |
14 | 75b486b059 |
15 | 3eb9a7b88c |
hex | 23ab762817 |
153200502807 has 32 divisors (see below), whose sum is σ = 223401889536. Its totient is φ = 92613715200.
The previous prime is 153200502787. The next prime is 153200502863. The reversal of 153200502807 is 708205002351.
153200502807 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-153200502807 is a prime.
It is a super-2 number, since 2×1532005028072 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153200572807) 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 31 ways as a sum of consecutive naturals, for example, 48433608 + ... + 48436770.
It is an arithmetic number, because the mean of its divisors is an integer number (6981309048).
Almost surely, 2153200502807 is an apocalyptic number.
153200502807 is a deficient number, since it is larger than the sum of its proper divisors (70201386729).
153200502807 is a wasteful number, since it uses less digits than its factorization.
153200502807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6431.
The product of its (nonzero) digits is 16800, while the sum is 33.
The spelling of 153200502807 in words is "one hundred fifty-three billion, two hundred million, five hundred two thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •