Base | Representation |
---|---|
bin | 10010111000000001… |
… | …01000011100110111 |
3 | 222011020011102120021 |
4 | 21130000220130313 |
5 | 131223200313101 |
6 | 4353314150011 |
7 | 506056133266 |
oct | 113400503467 |
9 | 28136142507 |
10 | 10133604151 |
11 | 4330178870 |
12 | 1b69882307 |
13 | c56598598 |
14 | 6c1bc05dd |
15 | 3e499e5a1 |
hex | 25c028737 |
10133604151 has 4 divisors (see below), whose sum is σ = 11054840904. Its totient is φ = 9212367400.
The previous prime is 10133604121. The next prime is 10133604161. The reversal of 10133604151 is 15140633101.
10133604151 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15140633101 = 11 ⋅1376421191.
It is a cyclic number.
It is not a de Polignac number, because 10133604151 - 221 = 10131506999 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 (10133604121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 460618360 + ... + 460618381.
It is an arithmetic number, because the mean of its divisors is an integer number (2763710226).
Almost surely, 210133604151 is an apocalyptic number.
10133604151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10133604151 is a deficient number, since it is larger than the sum of its proper divisors (921236753).
10133604151 is an equidigital number, since it uses as much as digits as its factorization.
10133604151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921236752.
The product of its (nonzero) digits is 1080, while the sum is 25.
The spelling of 10133604151 in words is "ten billion, one hundred thirty-three million, six hundred four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •