Base | Representation |
---|---|
bin | 10001101001110011001… |
… | …000001110000011010101 |
3 | 11021222020212211120120102 |
4 | 101221303020032003111 |
5 | 124333423222441041 |
6 | 2325143542543445 |
7 | 153434024341661 |
oct | 21516310160325 |
9 | 4258225746512 |
10 | 1213112312021 |
11 | 4285293021a5 |
12 | 177138a37b85 |
13 | 8a51c02120c |
14 | 42a01b6b8a1 |
15 | 21850e2509b |
hex | 11a7320e0d5 |
1213112312021 has 16 divisors (see below), whose sum is σ = 1240048537728. Its totient is φ = 1186482816000.
The previous prime is 1213112311997. The next prime is 1213112312059. The reversal of 1213112312021 is 1202132113121.
It is a cyclic number.
It is not a de Polignac number, because 1213112312021 - 210 = 1213112310997 is a prime.
It is a super-2 number, since 2×12131123120212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1213112311984 and 1213112312002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213112312921) 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, 6197765 + ... + 6390501.
It is an arithmetic number, because the mean of its divisors is an integer number (77503033608).
Almost surely, 21213112312021 is an apocalyptic number.
It is an amenable number.
1213112312021 is a deficient number, since it is larger than the sum of its proper divisors (26936225707).
1213112312021 is a wasteful number, since it uses less digits than its factorization.
1213112312021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193532.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1213112312021 its reverse (1202132113121), we get a palindrome (2415244425142).
The spelling of 1213112312021 in words is "one trillion, two hundred thirteen billion, one hundred twelve million, three hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •