Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …000111100001100011100001 |
3 | 1000112120202112202201120111110 |
4 | 233300003010013201203201 |
5 | 210011301000332241001 |
6 | 2022353133421333533 |
7 | 62143502565612120 |
oct | 5760030407414341 |
9 | 1015522482646443 |
10 | 210010011212001 |
11 | 60a0882241a0a0 |
12 | 1b67941ba072a9 |
13 | 9024b2252bc90 |
14 | 39c0778593ab7 |
15 | 1942c97d573d6 |
hex | bf00c41e18e1 |
210010011212001 has 128 divisors (see below), whose sum is σ = 386983166976000. Its totient is φ = 97764122050560.
The previous prime is 210010011211991. The next prime is 210010011212051. The reversal of 210010011212001 is 100212110010012.
It is not a de Polignac number, because 210010011212001 - 217 = 210010011080929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210010011212051) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 47784060 + ... + 51993618.
It is an arithmetic number, because the mean of its divisors is an integer number (3023305992000).
Almost surely, 2210010011212001 is an apocalyptic number.
210010011212001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
210010011212001 is a deficient number, since it is larger than the sum of its proper divisors (176973155763999).
210010011212001 is a wasteful number, since it uses less digits than its factorization.
210010011212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4210079.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210010011212001 its reverse (100212110010012), we get a palindrome (310222121222013).
It can be divided in two parts, 210010011 and 212001, that added together give a palindrome (210222012).
The spelling of 210010011212001 in words is "two hundred ten trillion, ten billion, eleven million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •