Base | Representation |
---|---|
bin | 1000111011001000001… |
… | …0101000110010010111 |
3 | 112122201111111012201001 |
4 | 2032302002220302113 |
5 | 10002440042004114 |
6 | 154232520244131 |
7 | 14035121034106 |
oct | 2166202506227 |
9 | 478644435631 |
10 | 153310891159 |
11 | 5a023001738 |
12 | 25867610647 |
13 | 115c34a5b5a |
14 | 75c53a403d |
15 | 3ec45d4374 |
hex | 23b20a8c97 |
153310891159 has 4 divisors (see below), whose sum is σ = 153311849280. Its totient is φ = 153309933040.
The previous prime is 153310891141. The next prime is 153310891211. The reversal of 153310891159 is 951198013351.
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, and also an emirpimes, since its reverse is a distinct semiprime: 951198013351 = 3001 ⋅316960351.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153310891159 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 (153310891109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174502 + ... + 580579.
It is an arithmetic number, because the mean of its divisors is an integer number (38327962320).
Almost surely, 2153310891159 is an apocalyptic number.
153310891159 is a deficient number, since it is larger than the sum of its proper divisors (958121).
153310891159 is an equidigital number, since it uses as much as digits as its factorization.
153310891159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958120.
The product of its (nonzero) digits is 145800, while the sum is 46.
The spelling of 153310891159 in words is "one hundred fifty-three billion, three hundred ten million, eight hundred ninety-one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •