Base | Representation |
---|---|
bin | 1001000110110001101011… |
… | …1010000101011010001101 |
3 | 1022110010202220100201212202 |
4 | 2101230122322011122031 |
5 | 2303014104132413401 |
6 | 33143243015411245 |
7 | 2052226123355342 |
oct | 221543272053215 |
9 | 38403686321782 |
10 | 10012020201101 |
11 | 321008a433016 |
12 | 1158491383b25 |
13 | 57818b543b59 |
14 | 2688276c87c9 |
15 | 12568035406b |
hex | 91b1ae8568d |
10012020201101 has 8 divisors (see below), whose sum is σ = 10256261601600. Its totient is φ = 9767780980960.
The previous prime is 10012020201097. The next prime is 10012020201137. The reversal of 10012020201101 is 10110202021001.
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 10012020201101 - 22 = 10012020201097 is a prime.
It is a super-2 number, since 2×100120202011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012020201181) 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, 12529880 + ... + 13304958.
It is an arithmetic number, because the mean of its divisors is an integer number (1282032700200).
Almost surely, 210012020201101 is an apocalyptic number.
It is an amenable number.
10012020201101 is a deficient number, since it is larger than the sum of its proper divisors (244241400499).
10012020201101 is an equidigital number, since it uses as much as digits as its factorization.
10012020201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090179.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10012020201101 its reverse (10110202021001), we get a palindrome (20122222222102).
The spelling of 10012020201101 in words is "ten trillion, twelve billion, twenty million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •