Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …001110000001100111101 |
3 | 10221020020010122211110212 |
4 | 100022321101300030331 |
5 | 121201224230014323 |
6 | 2210252142442205 |
7 | 143165551110554 |
oct | 20127121601475 |
9 | 3836203584425 |
10 | 1111210001213 |
11 | 399297092904 |
12 | 15b439b93365 |
13 | 80a2c37c1a0 |
14 | 3bad6200d9b |
15 | 1dd89bc2b78 |
hex | 102b947033d |
1111210001213 has 16 divisors (see below), whose sum is σ = 1267118173440. Its totient is φ = 965366858496.
The previous prime is 1111210001191. The next prime is 1111210001219. The reversal of 1111210001213 is 3121000121111.
It is a cyclic number.
It is not a de Polignac number, because 1111210001213 - 236 = 1042490524477 is a prime.
It is a super-2 number, since 2×11112100012132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111210001219) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11871248 + ... + 11964486.
It is an arithmetic number, because the mean of its divisors is an integer number (79194885840).
Almost surely, 21111210001213 is an apocalyptic number.
1111210001213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1111210001213 is a deficient number, since it is larger than the sum of its proper divisors (155908172227).
1111210001213 is a wasteful number, since it uses less digits than its factorization.
1111210001213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147196.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1111210001213 its reverse (3121000121111), we get a palindrome (4232210122324).
The spelling of 1111210001213 in words is "one trillion, one hundred eleven billion, two hundred ten million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •