Base | Representation |
---|---|
bin | 100100000111101… |
… | …1100111011110111 |
3 | 10010110121111110211 |
4 | 1020033130323313 |
5 | 4440233311411 |
6 | 320133330251 |
7 | 42014626345 |
oct | 11017347367 |
9 | 3113544424 |
10 | 1212010231 |
11 | 57216a253 |
12 | 299a96987 |
13 | 16413b023 |
14 | b6d78995 |
15 | 7160e221 |
hex | 483dcef7 |
1212010231 has 4 divisors (see below), whose sum is σ = 1264706352. Its totient is φ = 1159314112.
The previous prime is 1212010213. The next prime is 1212010243. The reversal of 1212010231 is 1320102121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1212010231 - 25 = 1212010199 is a prime.
It is a super-2 number, since 2×12120102312 = 2937937600097346722, 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 (1212010211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26348026 + ... + 26348071.
It is an arithmetic number, because the mean of its divisors is an integer number (316176588).
Almost surely, 21212010231 is an apocalyptic number.
1212010231 is a deficient number, since it is larger than the sum of its proper divisors (52696121).
1212010231 is an equidigital number, since it uses as much as digits as its factorization.
1212010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52696120.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1212010231 is about 34813.9373096465. The cubic root of 1212010231 is about 1066.1920222989.
Adding to 1212010231 its reverse (1320102121), we get a palindrome (2532112352).
The spelling of 1212010231 in words is "one billion, two hundred twelve million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •