Base | Representation |
---|---|
bin | 101101111110011010010111… |
… | …011000010101011100101011 |
3 | 222111221020011001102222202102 |
4 | 231332122113120111130223 |
5 | 203000330132041200021 |
6 | 1554013510042324015 |
7 | 60406353345424556 |
oct | 5576322730253453 |
9 | 874836131388672 |
10 | 202201010100011 |
11 | 59477a6a91742a |
12 | 1a817ab11b960b |
13 | 88a96201a7820 |
14 | 37d081c7b169d |
15 | 1859aa401a00b |
hex | b7e69761572b |
202201010100011 has 4 divisors (see below), whose sum is σ = 217754933953872. Its totient is φ = 186647086246152.
The previous prime is 202201010099987. The next prime is 202201010100017. The reversal of 202201010100011 is 110001010102202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202201010100011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202201010099965 and 202201010100001.
It is not an unprimeable number, because it can be changed into a prime (202201010100017) 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, 7776961926911 + ... + 7776961926936.
It is an arithmetic number, because the mean of its divisors is an integer number (54438733488468).
Almost surely, 2202201010100011 is an apocalyptic number.
202201010100011 is a deficient number, since it is larger than the sum of its proper divisors (15553923853861).
202201010100011 is a wasteful number, since it uses less digits than its factorization.
202201010100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15553923853860.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 202201010100011 its reverse (110001010102202), we get a palindrome (312202020202213).
The spelling of 202201010100011 in words is "two hundred two trillion, two hundred one billion, ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •