Base | Representation |
---|---|
bin | 1011110110011100100111… |
… | …0110000100011110100101 |
3 | 1201010122202122120110212002 |
4 | 2331213021312010132211 |
5 | 3201440441141001201 |
6 | 43413524244335045 |
7 | 2513250045204035 |
oct | 275471166043645 |
9 | 51118678513762 |
10 | 13030022203301 |
11 | 4174001929464 |
12 | 15653800a4485 |
13 | 73695882575c |
14 | 3309293ad8c5 |
15 | 178e1a1e976b |
hex | bd9c9d847a5 |
13030022203301 has 4 divisors (see below), whose sum is σ = 13715812845600. Its totient is φ = 12344231561004.
The previous prime is 13030022203277. The next prime is 13030022203357. The reversal of 13030022203301 is 10330222003031.
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 a de Polignac number, because none of the positive numbers 2k-13030022203301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13030022203381) 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, 342895321121 + ... + 342895321158.
It is an arithmetic number, because the mean of its divisors is an integer number (3428953211400).
Almost surely, 213030022203301 is an apocalyptic number.
It is an amenable number.
13030022203301 is a deficient number, since it is larger than the sum of its proper divisors (685790642299).
13030022203301 is an equidigital number, since it uses as much as digits as its factorization.
13030022203301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 685790642298.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13030022203301 its reverse (10330222003031), we get a palindrome (23360244206332).
The spelling of 13030022203301 in words is "thirteen trillion, thirty billion, twenty-two million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.502 sec. • engine limits •