Base | Representation |
---|---|
bin | 1001010010010111010110… |
… | …1001101000101000100001 |
3 | 1100011011122220000212110212 |
4 | 2110211311221220220201 |
5 | 2314244323421024301 |
6 | 33414530352503505 |
7 | 2102504565234440 |
oct | 224456551505041 |
9 | 40134586025425 |
10 | 10211111111201 |
11 | 3287565023550 |
12 | 118ab9454ab95 |
13 | 590b994060c0 |
14 | 274312b64d57 |
15 | 12a933aa34bb |
hex | 94975a68a21 |
10211111111201 has 64 divisors (see below), whose sum is σ = 13784949620736. Its totient is φ = 7304538009600.
The previous prime is 10211111111189. The next prime is 10211111111261.
10211111111201 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10211111111201 - 210 = 10211111110177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10211111111261) 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 63 ways as a sum of consecutive naturals, for example, 1118776100 + ... + 1118785226.
It is an arithmetic number, because the mean of its divisors is an integer number (215389837824).
Almost surely, 210211111111201 is an apocalyptic number.
10211111111201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10211111111201 is a deficient number, since it is larger than the sum of its proper divisors (3573838509535).
10211111111201 is a wasteful number, since it uses less digits than its factorization.
10211111111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15142.
The product of its (nonzero) digits is 4, while the sum is 14.
It can be divided in two parts, 1021111 and 1111201, that multiplied together give a palindrome (1134659564311).
The spelling of 10211111111201 in words is "ten trillion, two hundred eleven billion, one hundred eleven million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •