Base | Representation |
---|---|
bin | 100010100001001… |
… | …1100000011110001 |
3 | 2222201111001210021 |
4 | 1011002130003301 |
5 | 4333004021441 |
6 | 310533403441 |
7 | 40463052034 |
oct | 10502340361 |
9 | 2881431707 |
10 | 1158267121 |
11 | 5448a2260 |
12 | 283a99581 |
13 | 155c71c7b |
14 | adb8901b |
15 | 6ba453d1 |
hex | 4509c0f1 |
1158267121 has 4 divisors (see below), whose sum is σ = 1263564144. Its totient is φ = 1052970100.
The previous prime is 1158267109. The next prime is 1158267127. The reversal of 1158267121 is 1217628511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1217628511 = 11 ⋅110693501.
It is a cyclic number.
It is not a de Polignac number, because 1158267121 - 215 = 1158234353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1158267127) 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, 52648495 + ... + 52648516.
It is an arithmetic number, because the mean of its divisors is an integer number (315891036).
Almost surely, 21158267121 is an apocalyptic number.
1158267121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1158267121 is a deficient number, since it is larger than the sum of its proper divisors (105297023).
1158267121 is a wasteful number, since it uses less digits than its factorization.
1158267121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105297022.
The product of its digits is 6720, while the sum is 34.
The square root of 1158267121 is about 34033.3236842951. The cubic root of 1158267121 is about 1050.1941050071.
The spelling of 1158267121 in words is "one billion, one hundred fifty-eight million, two hundred sixty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •