Base | Representation |
---|---|
bin | 100100001010000… |
… | …0010101000101111 |
3 | 10010112212121200101 |
4 | 1020110002220233 |
5 | 4441040310411 |
6 | 320215211531 |
7 | 42031066546 |
oct | 11024025057 |
9 | 3115777611 |
10 | 1213213231 |
11 | 57291106a |
12 | 29a376ba7 |
13 | 16446c769 |
14 | b71ad15d |
15 | 7179a8c1 |
hex | 48502a2f |
1213213231 has 8 divisors (see below), whose sum is σ = 1255456800. Its totient is φ = 1170996960.
The previous prime is 1213213217. The next prime is 1213213237. The reversal of 1213213231 is 1323123121.
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 1213213231 - 27 = 1213213103 is a prime.
It is a super-2 number, since 2×12132132312 = 2943772687746918722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1213213199 and 1213213208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213213237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131221 + ... + 140161.
It is an arithmetic number, because the mean of its divisors is an integer number (156932100).
Almost surely, 21213213231 is an apocalyptic number.
1213213231 is a deficient number, since it is larger than the sum of its proper divisors (42243569).
1213213231 is an equidigital number, since it uses as much as digits as its factorization.
1213213231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13649.
The product of its digits is 216, while the sum is 19.
The square root of 1213213231 is about 34831.2105876325. The cubic root of 1213213231 is about 1066.5446609261.
Adding to 1213213231 its reverse (1323123121), we get a palindrome (2536336352).
The spelling of 1213213231 in words is "one billion, two hundred thirteen million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •