Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1100011011111001010001 |
3 | 1022202202000211112011110211 |
4 | 2103000032030123321101 |
5 | 2311002344303034301 |
6 | 33252443441124121 |
7 | 2061563002412041 |
oct | 223001614337121 |
9 | 38682024464424 |
10 | 10102001221201 |
11 | 324526437023a |
12 | 1171a03929641 |
13 | 5837cb44c106 |
14 | 26cd21c85721 |
15 | 127b99bd2051 |
hex | 9300e31be51 |
10102001221201 has 8 divisors (see below), whose sum is σ = 10699005550464. Its totient is φ = 9505304554560.
The previous prime is 10102001221199. The next prime is 10102001221289. The reversal of 10102001221201 is 10212210020101.
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 10102001221201 - 21 = 10102001221199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10102001221801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76848045 + ... + 76979386.
It is an arithmetic number, because the mean of its divisors is an integer number (1337375693808).
Almost surely, 210102001221201 is an apocalyptic number.
It is an amenable number.
10102001221201 is a deficient number, since it is larger than the sum of its proper divisors (597004329263).
10102001221201 is a wasteful number, since it uses less digits than its factorization.
10102001221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153831311.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10102001221201 its reverse (10212210020101), we get a palindrome (20314211241302).
The spelling of 10102001221201 in words is "ten trillion, one hundred two billion, one million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •