Base | Representation |
---|---|
bin | 10001101001111010001… |
… | …101110100100111100110 |
3 | 11021222120011120210022220 |
4 | 101221322031310213212 |
5 | 124334144143034342 |
6 | 2325203431333210 |
7 | 153440000141016 |
oct | 21517215644746 |
9 | 4258504523286 |
10 | 1213231221222 |
11 | 42858a439469 |
12 | 177170821206 |
13 | 8a53a8557a7 |
14 | 42a13881c46 |
15 | 2185b5b25ec |
hex | 11a7a3749e6 |
1213231221222 has 32 divisors (see below), whose sum is σ = 2492185059072. Its totient is φ = 393457888224.
The previous prime is 1213231221221. The next prime is 1213231221263. The reversal of 1213231221222 is 2221221323121.
It is a super-2 number, since 2×12132312212222 (a number of 25 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 1213231221192 and 1213231221201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213231221221) 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, 3979303 + ... + 4273325.
It is an arithmetic number, because the mean of its divisors is an integer number (77880783096).
Almost surely, 21213231221222 is an apocalyptic number.
1213231221222 is an abundant number, since it is smaller than the sum of its proper divisors (1278953837850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1213231221222 is a wasteful number, since it uses less digits than its factorization.
1213231221222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 312652.
The product of its digits is 1152, while the sum is 24.
Adding to 1213231221222 its reverse (2221221323121), we get a palindrome (3434452544343).
The spelling of 1213231221222 in words is "one trillion, two hundred thirteen billion, two hundred thirty-one million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •