Base | Representation |
---|---|
bin | 100110110010010… |
… | …0100111100001001 |
3 | 10100200212200222202 |
4 | 1031210210330021 |
5 | 10131131342441 |
6 | 333050125545 |
7 | 44152002401 |
oct | 11544447411 |
9 | 3320780882 |
10 | 1301434121 |
11 | 608697799 |
12 | 303a208b5 |
13 | 17981a980 |
14 | c4bb5801 |
15 | 793c519b |
hex | 4d924f09 |
1301434121 has 8 divisors (see below), whose sum is σ = 1405152840. Its totient is φ = 1198230912.
The previous prime is 1301434117. The next prime is 1301434153. The reversal of 1301434121 is 1214341031.
It can be written as a sum of positive squares in 4 ways, for example, as 80910025 + 1220524096 = 8995^2 + 34936^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1301434121 - 22 = 1301434117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301434093 and 1301434102.
It is not an unprimeable number, because it can be changed into a prime (1301434111) 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, 123620 + ... + 133733.
It is an arithmetic number, because the mean of its divisors is an integer number (175644105).
Almost surely, 21301434121 is an apocalyptic number.
It is an amenable number.
1301434121 is a deficient number, since it is larger than the sum of its proper divisors (103718719).
1301434121 is a wasteful number, since it uses less digits than its factorization.
1301434121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257755.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1301434121 is about 36075.3949527930. The cubic root of 1301434121 is about 1091.7940662018.
Adding to 1301434121 its reverse (1214341031), we get a palindrome (2515775152).
The spelling of 1301434121 in words is "one billion, three hundred one million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •