Base | Representation |
---|---|
bin | 111110000000011… |
… | …011100001011001 |
3 | 2200111111201111010 |
4 | 332000123201121 |
5 | 4112304100441 |
6 | 251121124133 |
7 | 34531255650 |
oct | 7600334131 |
9 | 2614451433 |
10 | 1040300121 |
11 | 494249973 |
12 | 250489649 |
13 | 1376aa503 |
14 | 9c23c197 |
15 | 614e2116 |
hex | 3e01b859 |
1040300121 has 8 divisors (see below), whose sum is σ = 1585219264. Its totient is φ = 594457200.
The previous prime is 1040300111. The next prime is 1040300153. The reversal of 1040300121 is 1210030401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1040300121 - 215 = 1040267353 is a prime.
It is a super-2 number, since 2×10403001212 = 2164448683505229282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1040300097 and 1040300106.
It is not an unprimeable number, because it can be changed into a prime (1040300111) 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, 24769030 + ... + 24769071.
It is an arithmetic number, because the mean of its divisors is an integer number (198152408).
Almost surely, 21040300121 is an apocalyptic number.
It is an amenable number.
1040300121 is a deficient number, since it is larger than the sum of its proper divisors (544919143).
1040300121 is an equidigital number, since it uses as much as digits as its factorization.
1040300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49538111.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 1040300121 is about 32253.6838361140. The cubic root of 1040300121 is about 1013.2568529127.
Adding to 1040300121 its reverse (1210030401), we get a palindrome (2250330522).
The spelling of 1040300121 in words is "one billion, forty million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •