Base | Representation |
---|---|
bin | 1001010001110001110001… |
… | …0011100010011110100001 |
3 | 1100010012121202222200120112 |
4 | 2110130130103202132201 |
5 | 2314113143141241001 |
6 | 33410141312421105 |
7 | 2101666561063235 |
oct | 224343423423641 |
9 | 40105552880515 |
10 | 10201022212001 |
11 | 328325810a225 |
12 | 1189039847795 |
13 | 58cc4c190a6a |
14 | 273a36ca05c5 |
15 | 12a542ed4cbb |
hex | 9471c4e27a1 |
10201022212001 has 8 divisors (see below), whose sum is σ = 10203382725480. Its totient is φ = 10198661885568.
The previous prime is 10201022211979. The next prime is 10201022212037. The reversal of 10201022212001 is 10021222010201.
It can be written as a sum of positive squares in 4 ways, for example, as 8167821376 + 10192854390625 = 90376^2 + 3192625^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201022212001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201022212061) 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, 197526755 + ... + 197578391.
It is an arithmetic number, because the mean of its divisors is an integer number (1275422840685).
Almost surely, 210201022212001 is an apocalyptic number.
It is an amenable number.
10201022212001 is a deficient number, since it is larger than the sum of its proper divisors (2360513479).
10201022212001 is an equidigital number, since it uses as much as digits as its factorization.
10201022212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93523.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10201022212001 its reverse (10021222010201), we get a palindrome (20222244222202).
The spelling of 10201022212001 in words is "ten trillion, two hundred one billion, twenty-two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •