Base | Representation |
---|---|
bin | 1001010001110010011100… |
… | …0110011011000101001101 |
3 | 1100010020002101210002110012 |
4 | 2110130213012123011031 |
5 | 2314114031022320323 |
6 | 33410211302323005 |
7 | 2102004220360250 |
oct | 224344706330515 |
9 | 40106071702405 |
10 | 10201203323213 |
11 | 3283340370811 |
12 | 118908a429465 |
13 | 58cc7a863666 |
14 | 273a52d67097 |
15 | 12a553d5c678 |
hex | 9472719b14d |
10201203323213 has 4 divisors (see below), whose sum is σ = 11658518083680. Its totient is φ = 8743888562748.
The previous prime is 10201203323209. The next prime is 10201203323231. The reversal of 10201203323213 is 31232330210201.
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 10201203323213 - 22 = 10201203323209 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 (10201203322213) 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, 728657380223 + ... + 728657380236.
It is an arithmetic number, because the mean of its divisors is an integer number (2914629520920).
Almost surely, 210201203323213 is an apocalyptic number.
It is an amenable number.
10201203323213 is a deficient number, since it is larger than the sum of its proper divisors (1457314760467).
10201203323213 is an equidigital number, since it uses as much as digits as its factorization.
10201203323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457314760466.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10201203323213 its reverse (31232330210201), we get a palindrome (41433533533414).
The spelling of 10201203323213 in words is "ten trillion, two hundred one billion, two hundred three million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •