Base | Representation |
---|---|
bin | 10010111010101110101… |
… | …101001101010100100101 |
3 | 11121021120000102222111010 |
4 | 102322232231031110211 |
5 | 132244410332210041 |
6 | 2433114503532433 |
7 | 162631326650556 |
oct | 22725655152445 |
9 | 4537500388433 |
10 | 1300011210021 |
11 | 461371489477 |
12 | 18bb4b15a119 |
13 | 9578a5209a4 |
14 | 46cc6c6632d |
15 | 23c39ddba16 |
hex | 12eaeb4d525 |
1300011210021 has 4 divisors (see below), whose sum is σ = 1733348280032. Its totient is φ = 866674140012.
The previous prime is 1300011210007. The next prime is 1300011210119. The reversal of 1300011210021 is 1200121100031.
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 not a de Polignac number, because 1300011210021 - 26 = 1300011209957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300011209979 and 1300011210006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300016210021) 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, 216668535001 + ... + 216668535006.
It is an arithmetic number, because the mean of its divisors is an integer number (433337070008).
Almost surely, 21300011210021 is an apocalyptic number.
It is an amenable number.
1300011210021 is a deficient number, since it is larger than the sum of its proper divisors (433337070011).
1300011210021 is an equidigital number, since it uses as much as digits as its factorization.
1300011210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433337070010.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1300011210021 its reverse (1200121100031), we get a palindrome (2500132310052).
The spelling of 1300011210021 in words is "one trillion, three hundred billion, eleven million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •