Base | Representation |
---|---|
bin | 1001010001110001101100… |
… | …0011011011100100101001 |
3 | 1100010012120022110210021011 |
4 | 2110130123003123210221 |
5 | 2314113122302242301 |
6 | 33410135242343521 |
7 | 2101666214431312 |
oct | 224343303334451 |
9 | 40105508423234 |
10 | 10201001212201 |
11 | 3283247276818 |
12 | 11890327baba1 |
13 | 58cc47a1a547 |
14 | 273a34195609 |
15 | 12a541237a51 |
hex | 9471b0db929 |
10201001212201 has 8 divisors (see below), whose sum is σ = 10418122915200. Its totient is φ = 9983882806128.
The previous prime is 10201001212183. The next prime is 10201001212253. The reversal of 10201001212201 is 10221210010201.
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 10201001212201 - 25 = 10201001212169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201001212001) 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, 6029995 + ... + 7534111.
It is an arithmetic number, because the mean of its divisors is an integer number (1302265364400).
Almost surely, 210201001212201 is an apocalyptic number.
It is an amenable number.
10201001212201 is a deficient number, since it is larger than the sum of its proper divisors (217121702999).
10201001212201 is a wasteful number, since it uses less digits than its factorization.
10201001212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1648463.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10201001212201 its reverse (10221210010201), we get a palindrome (20422211222402).
It can be divided in two parts, 1020100 and 1212201, that multiplied together give a square (1236566240100 = 11120102).
The spelling of 10201001212201 in words is "ten trillion, two hundred one billion, one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •