Base | Representation |
---|---|
bin | 100010010111111… |
… | …1011000000000001 |
3 | 2222101100110100111 |
4 | 1010233323000001 |
5 | 4330233204441 |
6 | 310241351321 |
7 | 40403564320 |
oct | 10457730001 |
9 | 2871313314 |
10 | 1153413121 |
11 | 542087393 |
12 | 282338541 |
13 | 154c62793 |
14 | ad2840b7 |
15 | 6b3d7081 |
hex | 44bfb001 |
1153413121 has 8 divisors (see below), whose sum is σ = 1319818304. Its totient is φ = 987415920.
The previous prime is 1153413109. The next prime is 1153413137. The reversal of 1153413121 is 1213143511.
It is a happy number.
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 1153413121 - 29 = 1153412609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1153413092 and 1153413101.
It is not an unprimeable number, because it can be changed into a prime (1153413101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95910 + ... + 107263.
It is an arithmetic number, because the mean of its divisors is an integer number (164977288).
Almost surely, 21153413121 is an apocalyptic number.
It is an amenable number.
1153413121 is a deficient number, since it is larger than the sum of its proper divisors (166405183).
1153413121 is an equidigital number, since it uses as much as digits as its factorization.
1153413121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203991.
The product of its digits is 360, while the sum is 22.
The square root of 1153413121 is about 33961.9363552787. The cubic root of 1153413121 is about 1048.7250196558.
Adding to 1153413121 its reverse (1213143511), we get a palindrome (2366556632).
The spelling of 1153413121 in words is "one billion, one hundred fifty-three million, four hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •