Base | Representation |
---|---|
bin | 1010001100100000100000… |
… | …0100101111001001110001 |
3 | 1110200122222011220011212000 |
4 | 2203020020010233021301 |
5 | 2432131040011231001 |
6 | 35501445234324213 |
7 | 2234616152455551 |
oct | 243101004571161 |
9 | 43618864804760 |
10 | 11210000102001 |
11 | 36321528a4818 |
12 | 13106a6429669 |
13 | 634138467c3c |
14 | 2aa7d1805161 |
15 | 1468e7a0ba86 |
hex | a320812f271 |
11210000102001 has 16 divisors (see below), whose sum is σ = 16699161198720. Its totient is φ = 7432044263280.
The previous prime is 11210000101991. The next prime is 11210000102033. The reversal of 11210000102001 is 10020100001211.
It is a happy number.
It is not a de Polignac number, because 11210000102001 - 25 = 11210000101969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11210000102501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1146915525 + ... + 1146925298.
It is an arithmetic number, because the mean of its divisors is an integer number (1043697574920).
Almost surely, 211210000102001 is an apocalyptic number.
It is an amenable number.
11210000102001 is a deficient number, since it is larger than the sum of its proper divisors (5489161096719).
11210000102001 is a wasteful number, since it uses less digits than its factorization.
11210000102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2293841013 (or 2293841007 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11210000102001 its reverse (10020100001211), we get a palindrome (21230100103212).
The spelling of 11210000102001 in words is "eleven trillion, two hundred ten billion, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •