Base | Representation |
---|---|
bin | 1011110101111110110011… |
… | …1100101011000010110101 |
3 | 1201002220010001021111120022 |
4 | 2331133230330223002311 |
5 | 3201323044411431401 |
6 | 43410122311214525 |
7 | 2512544552623652 |
oct | 275375474530265 |
9 | 51086101244508 |
10 | 13022021202101 |
11 | 417067653787a |
12 | 1563908677445 |
13 | 735c82021a12 |
14 | 3303aa924c29 |
15 | 178aecaa271b |
hex | bd7ecf2b0b5 |
13022021202101 has 8 divisors (see below), whose sum is σ = 13190966505600. Its totient is φ = 12853178638560.
The previous prime is 13022021202097. The next prime is 13022021202137. The reversal of 13022021202101 is 10120212022031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13022021202101 - 22 = 13022021202097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13022021202101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022021202161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25429835 + ... + 25936856.
It is an arithmetic number, because the mean of its divisors is an integer number (1648870813200).
Almost surely, 213022021202101 is an apocalyptic number.
It is an amenable number.
13022021202101 is a deficient number, since it is larger than the sum of its proper divisors (168945303499).
13022021202101 is an equidigital number, since it uses as much as digits as its factorization.
13022021202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51369979.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 13022021202101 its reverse (10120212022031), we get a palindrome (23142233224132).
The spelling of 13022021202101 in words is "thirteen trillion, twenty-two billion, twenty-one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •