Base | Representation |
---|---|
bin | 1001001101110101000111… |
… | …1010110001100101010001 |
3 | 1022212201120021200210011010 |
4 | 2103131101322301211101 |
5 | 2312010244231310301 |
6 | 33315043454441133 |
7 | 2064046124440224 |
oct | 223352172614521 |
9 | 38781507623133 |
10 | 10133202213201 |
11 | 3257515528341 |
12 | 1177a70b031a9 |
13 | 586731595062 |
14 | 2706419db5bb |
15 | 1288c3e905d6 |
hex | 93751eb1951 |
10133202213201 has 8 divisors (see below), whose sum is σ = 13519492931680. Its totient is φ = 6751189818432.
The previous prime is 10133202213181. The next prime is 10133202213203. The reversal of 10133202213201 is 10231220233101.
10133202213201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10133202213201 - 29 = 10133202212689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10133202213203) 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, 1069575400 + ... + 1069584873.
It is an arithmetic number, because the mean of its divisors is an integer number (1689936616460).
Almost surely, 210133202213201 is an apocalyptic number.
It is an amenable number.
10133202213201 is a deficient number, since it is larger than the sum of its proper divisors (3386290718479).
10133202213201 is a wasteful number, since it uses less digits than its factorization.
10133202213201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2139161855.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10133202213201 its reverse (10231220233101), we get a palindrome (20364422446302).
The spelling of 10133202213201 in words is "ten trillion, one hundred thirty-three billion, two hundred two million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •