Base | Representation |
---|---|
bin | 10001101001110011000… |
… | …011101011110101100101 |
3 | 11021222020210121011221202 |
4 | 101221303003223311211 |
5 | 124333422421421201 |
6 | 2325143501252245 |
7 | 153434011261220 |
oct | 21516303536545 |
9 | 4258223534852 |
10 | 1213111123301 |
11 | 428528670090 |
12 | 177138564085 |
13 | 8a51b9c612c |
14 | 42a0193c5b7 |
15 | 21850c8cc6b |
hex | 11a730ebd65 |
1213111123301 has 16 divisors (see below), whose sum is σ = 1513471609728. Its totient is φ = 944643033600.
The previous prime is 1213111123271. The next prime is 1213111123313. The reversal of 1213111123301 is 1033211113121.
It is a de Polignac number, because none of the positive numbers 2k-1213111123301 is a prime.
It is a super-2 number, since 2×12131111233012 (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 (1213111123801) 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, 5204900 + ... + 5432973.
It is an arithmetic number, because the mean of its divisors is an integer number (94591975608).
Almost surely, 21213111123301 is an apocalyptic number.
1213111123301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1213111123301 is a deficient number, since it is larger than the sum of its proper divisors (300360486427).
1213111123301 is a wasteful number, since it uses less digits than its factorization.
1213111123301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10639372.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1213111123301 its reverse (1033211113121), we get a palindrome (2246322236422).
The spelling of 1213111123301 in words is "one trillion, two hundred thirteen billion, one hundred eleven million, one hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •