Base | Representation |
---|---|
bin | 10010111011110001100… |
… | …101101110011100100101 |
3 | 11121101110012220011202211 |
4 | 102323301211232130211 |
5 | 132304210112301041 |
6 | 2433422110403421 |
7 | 163001203520251 |
oct | 22736145563445 |
9 | 4541405804684 |
10 | 1301133322021 |
11 | 461897926865 |
12 | 190202b00571 |
13 | 95908b441a0 |
14 | 46d91cbd261 |
15 | 23ca368e481 |
hex | 12ef196e725 |
1301133322021 has 16 divisors (see below), whose sum is σ = 1475324928000. Its totient is φ = 1137558575808.
The previous prime is 1301133322019. The next prime is 1301133322051. The reversal of 1301133322021 is 1202233311031.
It is a cyclic number.
It is not a de Polignac number, because 1301133322021 - 21 = 1301133322019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1301133321983 and 1301133322001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301133322051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 393180 + ... + 1660378.
It is an arithmetic number, because the mean of its divisors is an integer number (92207808000).
Almost surely, 21301133322021 is an apocalyptic number.
It is an amenable number.
1301133322021 is a deficient number, since it is larger than the sum of its proper divisors (174191605979).
1301133322021 is a wasteful number, since it uses less digits than its factorization.
1301133322021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271388.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1301133322021 its reverse (1202233311031), we get a palindrome (2503366633052).
The spelling of 1301133322021 in words is "one trillion, three hundred one billion, one hundred thirty-three million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •