Base | Representation |
---|---|
bin | 1001000110101110101000… |
… | …0101001000000111110011 |
3 | 1022110001122210220121222111 |
4 | 2101223222011020013303 |
5 | 2303010414424342321 |
6 | 33143025433350151 |
7 | 2052166615361500 |
oct | 221535205100763 |
9 | 38401583817874 |
10 | 10011201012211 |
11 | 320a7a9a86303 |
12 | 11582a2b68357 |
13 | 57808a902ab9 |
14 | 26878a9a64a7 |
15 | 12563348b5e1 |
hex | 91aea1481f3 |
10011201012211 has 12 divisors (see below), whose sum is σ = 11645756962392. Its totient is φ = 8580974800608.
The previous prime is 10011201012209. The next prime is 10011201012269. The reversal of 10011201012211 is 11221010211001.
It is a happy number.
It is not a de Polignac number, because 10011201012211 - 21 = 10011201012209 is a prime.
It is a super-2 number, since 2×100112010122112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10011201012191 and 10011201012200.
It is not an unprimeable number, because it can be changed into a prime (10011201012611) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8393836 + ... + 9512038.
It is an arithmetic number, because the mean of its divisors is an integer number (970479746866).
Almost surely, 210011201012211 is an apocalyptic number.
10011201012211 is a deficient number, since it is larger than the sum of its proper divisors (1634555950181).
10011201012211 is a wasteful number, since it uses less digits than its factorization.
10011201012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1300930 (or 1300923 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10011201012211 its reverse (11221010211001), we get a palindrome (21232211223212).
The spelling of 10011201012211 in words is "ten trillion, eleven billion, two hundred one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •