Base | Representation |
---|---|
bin | 10010111100110001010… |
… | …010011111010010010101 |
3 | 11121111012200211201011222 |
4 | 102330301102133102111 |
5 | 132313402204133023 |
6 | 2434120124340125 |
7 | 163036531355615 |
oct | 22746122372225 |
9 | 4544180751158 |
10 | 1302202021013 |
11 | 462296102173 |
12 | 1904609a4645 |
13 | 95a4938595a |
14 | 47053bd0a45 |
15 | 23d173e0cc8 |
hex | 12f3149f495 |
1302202021013 has 4 divisors (see below), whose sum is σ = 1329908447040. Its totient is φ = 1274495594988.
The previous prime is 1302202021007. The next prime is 1302202021037. The reversal of 1302202021013 is 3101202022031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1302202021013 - 24 = 1302202020997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1302202020982 and 1302202021000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302202021213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13853212943 + ... + 13853213036.
It is an arithmetic number, because the mean of its divisors is an integer number (332477111760).
Almost surely, 21302202021013 is an apocalyptic number.
It is an amenable number.
1302202021013 is a deficient number, since it is larger than the sum of its proper divisors (27706426027).
1302202021013 is an equidigital number, since it uses as much as digits as its factorization.
1302202021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27706426026.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1302202021013 its reverse (3101202022031), we get a palindrome (4403404043044).
The spelling of 1302202021013 in words is "one trillion, three hundred two billion, two hundred two million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •