Base | Representation |
---|---|
bin | 100110110101010… |
… | …1000101000101001 |
3 | 10100210212101022120 |
4 | 1031222220220221 |
5 | 10132033201441 |
6 | 333144141453 |
7 | 44201335212 |
oct | 11552505051 |
9 | 3323771276 |
10 | 1303022121 |
11 | 609581895 |
12 | 304467889 |
13 | 179c5570b |
14 | c50aa409 |
15 | 795da966 |
hex | 4daa8a29 |
1303022121 has 8 divisors (see below), whose sum is σ = 1737590304. Its totient is φ = 868567680.
The previous prime is 1303022111. The next prime is 1303022131. The reversal of 1303022121 is 1212203031.
It is an interprime number because it is at equal distance from previous prime (1303022111) and next prime (1303022131).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1303022121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1303022121.
It is not an unprimeable number, because it can be changed into a prime (1303022111) 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, 3385 + ... + 51161.
It is an arithmetic number, because the mean of its divisors is an integer number (217198788).
Almost surely, 21303022121 is an apocalyptic number.
It is an amenable number.
1303022121 is a deficient number, since it is larger than the sum of its proper divisors (434568183).
1303022121 is an equidigital number, since it uses as much as digits as its factorization.
1303022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56871.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1303022121 is about 36097.3977039897. The cubic root of 1303022121 is about 1092.2379519761.
Adding to 1303022121 its reverse (1212203031), we get a palindrome (2515225152).
The spelling of 1303022121 in words is "one billion, three hundred three million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.447 sec. • engine limits •