Base | Representation |
---|---|
bin | 100001001110101… |
… | …1011010001001001 |
3 | 2212201002101100011 |
4 | 1002131123101021 |
5 | 4240420310441 |
6 | 302350311521 |
7 | 36426300241 |
oct | 10235332111 |
9 | 2781071304 |
10 | 1115010121 |
11 | 522437675 |
12 | 2714b85a1 |
13 | 14a007b04 |
14 | a8128b21 |
15 | 67d4d581 |
hex | 4275b449 |
1115010121 has 4 divisors (see below), whose sum is σ = 1115153172. Its totient is φ = 1114867072.
The previous prime is 1115010119. The next prime is 1115010151. The reversal of 1115010121 is 1210105111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1210105111 = 28649 ⋅42239.
It can be written as a sum of positive squares in 2 ways, for example, as 722534400 + 392475721 = 26880^2 + 19811^2 .
It is a cyclic number.
It is not a de Polignac number, because 1115010121 - 21 = 1115010119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1115010151) 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, 59116 + ... + 75661.
It is an arithmetic number, because the mean of its divisors is an integer number (278788293).
Almost surely, 21115010121 is an apocalyptic number.
It is an amenable number.
1115010121 is a deficient number, since it is larger than the sum of its proper divisors (143051).
1115010121 is an equidigital number, since it uses as much as digits as its factorization.
1115010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143050.
The product of its (nonzero) digits is 10, while the sum is 13.
The square root of 1115010121 is about 33391.7672638032. The cubic root of 1115010121 is about 1036.9542673239.
Adding to 1115010121 its reverse (1210105111), we get a palindrome (2325115232).
The spelling of 1115010121 in words is "one billion, one hundred fifteen million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •