Base | Representation |
---|---|
bin | 1000111010010111110… |
… | …1000001100111001111 |
3 | 112122012100220000110121 |
4 | 2032211331001213033 |
5 | 10002031132442031 |
6 | 154200433445411 |
7 | 14030106215011 |
oct | 2164575014717 |
9 | 478170800417 |
10 | 153108093391 |
11 | 59a29588780 |
12 | 2580b710867 |
13 | 1159047c286 |
14 | 75a64941b1 |
15 | 3eb18c6011 |
hex | 23a5f419cf |
153108093391 has 8 divisors (see below), whose sum is σ = 167032463184. Its totient is φ = 139184632320.
The previous prime is 153108093377. The next prime is 153108093407. The reversal of 153108093391 is 193390801351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 153108093391 - 225 = 153074538959 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 (153108093371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152751 + ... + 574063.
It is an arithmetic number, because the mean of its divisors is an integer number (20879057898).
Almost surely, 2153108093391 is an apocalyptic number.
153108093391 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
153108093391 is a deficient number, since it is larger than the sum of its proper divisors (13924369793).
153108093391 is a wasteful number, since it uses less digits than its factorization.
153108093391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454361.
The product of its (nonzero) digits is 87480, while the sum is 43.
The spelling of 153108093391 in words is "one hundred fifty-three billion, one hundred eight million, ninety-three thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •