Base | Representation |
---|---|
bin | 10010111100100110000… |
… | …001100010111101001101 |
3 | 11121110201112012222120000 |
4 | 102330212001202331031 |
5 | 132313010313431341 |
6 | 2434045253514513 |
7 | 163032045103221 |
oct | 22744601427515 |
9 | 4543645188500 |
10 | 1302013030221 |
11 | 4621a9459632 |
12 | 190409642a39 |
13 | 95a19184697 |
14 | 47036a76781 |
15 | 23d05a0d8b6 |
hex | 12f26062f4d |
1302013030221 has 20 divisors (see below), whose sum is σ = 1964239691964. Its totient is φ = 859414536000.
The previous prime is 1302013030181. The next prime is 1302013030249. The reversal of 1302013030221 is 1220303102031.
1302013030221 is a `hidden beast` number, since 130 + 201 + 30 + 302 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 636622068996 + 665390961225 = 797886^2 + 815715^2 .
It is not a de Polignac number, because 1302013030221 - 27 = 1302013030093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1302013030194 and 1302013030203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302013730221) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 79567240 + ... + 79583601.
Almost surely, 21302013030221 is an apocalyptic number.
It is an amenable number.
1302013030221 is a deficient number, since it is larger than the sum of its proper divisors (662226661743).
1302013030221 is a wasteful number, since it uses less digits than its factorization.
1302013030221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159150954 (or 159150945 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1302013030221 its reverse (1220303102031), we get a palindrome (2522316132252).
The spelling of 1302013030221 in words is "one trillion, three hundred two billion, thirteen million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •