Base | Representation |
---|---|
bin | 100100001001101… |
… | …0100000000010111 |
3 | 10010112111220200022 |
4 | 1020103110000113 |
5 | 4441013202411 |
6 | 320211135355 |
7 | 42026342651 |
oct | 11023240027 |
9 | 3115456608 |
10 | 1213022231 |
11 | 5727a0613 |
12 | 29a2a455b |
13 | 164403845 |
14 | b715d6d1 |
15 | 7175dedb |
hex | 484d4017 |
1213022231 has 8 divisors (see below), whose sum is σ = 1266524160. Its totient is φ = 1159583832.
The previous prime is 1213022147. The next prime is 1213022257. The reversal of 1213022231 is 1322203121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1213022231 - 210 = 1213021207 is a prime.
It is a super-2 number, since 2×12130222312 = 2942845865800434722, which 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 (1213022431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25466 + ... + 55448.
It is an arithmetic number, because the mean of its divisors is an integer number (158315520).
Almost surely, 21213022231 is an apocalyptic number.
1213022231 is a deficient number, since it is larger than the sum of its proper divisors (53501929).
1213022231 is a wasteful number, since it uses less digits than its factorization.
1213022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31765.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1213022231 is about 34828.4686858323. The cubic root of 1213022231 is about 1066.4886881545.
Adding to 1213022231 its reverse (1322203121), we get a palindrome (2535225352).
The spelling of 1213022231 in words is "one billion, two hundred thirteen million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •