Base | Representation |
---|---|
bin | 10001101001110011001… |
… | …011101110111011001101 |
3 | 11021222020221120101001111 |
4 | 101221303023232323031 |
5 | 124333423441424401 |
6 | 2325144014412021 |
7 | 153434035226230 |
oct | 21516313567315 |
9 | 4258227511044 |
10 | 1213113233101 |
11 | 428529881220 |
12 | 177139201011 |
13 | 8a51c284533 |
14 | 42a01d2b417 |
15 | 21851057e51 |
hex | 11a732eeecd |
1213113233101 has 32 divisors (see below), whose sum is σ = 1538293109760. Its totient is φ = 929137171200.
The previous prime is 1213113233077. The next prime is 1213113233159. The reversal of 1213113233101 is 1013323113121.
It is not a de Polignac number, because 1213113233101 - 27 = 1213113232973 is a prime.
It is a super-2 number, since 2×12131132331012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213113233701) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48556725 + ... + 48581701.
It is an arithmetic number, because the mean of its divisors is an integer number (48071659680).
Almost surely, 21213113233101 is an apocalyptic number.
1213113233101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1213113233101 is a deficient number, since it is larger than the sum of its proper divisors (325179876659).
1213113233101 is a wasteful number, since it uses less digits than its factorization.
1213113233101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35745.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1213113233101 its reverse (1013323113121), we get a palindrome (2226436346222).
The spelling of 1213113233101 in words is "one trillion, two hundred thirteen billion, one hundred thirteen million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •