Base | Representation |
---|---|
bin | 100101000001001… |
… | …1011110010111001 |
3 | 10012120022212101010 |
4 | 1022002123302321 |
5 | 10020442331441 |
6 | 323131344133 |
7 | 42532055520 |
oct | 11202336271 |
9 | 3176285333 |
10 | 1242152121 |
11 | 588187301 |
12 | 2a7bb2049 |
13 | 16a462772 |
14 | bad834b7 |
15 | 740b5116 |
hex | 4a09bcb9 |
1242152121 has 8 divisors (see below), whose sum is σ = 1892803264. Its totient is φ = 709801200.
The previous prime is 1242152101. The next prime is 1242152173. The reversal of 1242152121 is 1212512421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1242152121 - 26 = 1242152057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 59150101 = 1242152121 / (1 + 2 + 4 + 2 + 1 + 5 + 2 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1242152101) 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, 29575030 + ... + 29575071.
It is an arithmetic number, because the mean of its divisors is an integer number (236600408).
Almost surely, 21242152121 is an apocalyptic number.
It is an amenable number.
1242152121 is a deficient number, since it is larger than the sum of its proper divisors (650651143).
1242152121 is an equidigital number, since it uses as much as digits as its factorization.
1242152121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59150111.
The product of its digits is 320, while the sum is 21.
The square root of 1242152121 is about 35244.1785405760. The cubic root of 1242152121 is about 1074.9582449259.
Adding to 1242152121 its reverse (1212512421), we get a palindrome (2454664542).
The spelling of 1242152121 in words is "one billion, two hundred forty-two million, one hundred fifty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •