Base | Representation |
---|---|
bin | 1001000111010100011010… |
… | …0110100101100011111101 |
3 | 1022111000211122021021021120 |
4 | 2101311012212211203331 |
5 | 2303142202331101023 |
6 | 33151424100221153 |
7 | 2053006140626334 |
oct | 221650646454375 |
9 | 38430748237246 |
10 | 10021343222013 |
11 | 3214033aa1682 |
12 | 115a25369a7b9 |
13 | 579015bc2386 |
14 | 26906d986d1b |
15 | 125a28a8a8e3 |
hex | 91d469a58fd |
10021343222013 has 8 divisors (see below), whose sum is σ = 13385524163808. Its totient is φ = 6669028880784.
The previous prime is 10021343221999. The next prime is 10021343222021. The reversal of 10021343222013 is 31022234312001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10021343222013 - 29 = 10021343221501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021343222063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2966648170 + ... + 2966651547.
It is an arithmetic number, because the mean of its divisors is an integer number (1673190520476).
Almost surely, 210021343222013 is an apocalyptic number.
It is an amenable number.
10021343222013 is a deficient number, since it is larger than the sum of its proper divisors (3364180941795).
10021343222013 is an equidigital number, since it uses as much as digits as its factorization.
10021343222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5933300283.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10021343222013 its reverse (31022234312001), we get a palindrome (41043577534014).
The spelling of 10021343222013 in words is "ten trillion, twenty-one billion, three hundred forty-three million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •