Base | Representation |
---|---|
bin | 100101000011100… |
… | …1111011011110101 |
3 | 10012122200212220012 |
4 | 1022013033123311 |
5 | 10021303142323 |
6 | 323214350005 |
7 | 42545554331 |
oct | 11207173365 |
9 | 3178625805 |
10 | 1243412213 |
11 | 588967aaa |
12 | 2a84bb305 |
13 | 16a7b4194 |
14 | bb1d07c1 |
15 | 74263678 |
hex | 4a1cf6f5 |
1243412213 has 4 divisors (see below), whose sum is σ = 1269867840. Its totient is φ = 1216956588.
The previous prime is 1243412167. The next prime is 1243412221. The reversal of 1243412213 is 3122143421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3122143421 = 71 ⋅43973851.
It is a cyclic number.
It is not a de Polignac number, because 1243412213 - 222 = 1239217909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1243412243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13227743 + ... + 13227836.
It is an arithmetic number, because the mean of its divisors is an integer number (317466960).
Almost surely, 21243412213 is an apocalyptic number.
It is an amenable number.
1243412213 is a deficient number, since it is larger than the sum of its proper divisors (26455627).
1243412213 is an equidigital number, since it uses as much as digits as its factorization.
1243412213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26455626.
The product of its digits is 1152, while the sum is 23.
The square root of 1243412213 is about 35262.0506068493. The cubic root of 1243412213 is about 1075.3216165514.
Adding to 1243412213 its reverse (3122143421), we get a palindrome (4365555634).
The spelling of 1243412213 in words is "one billion, two hundred forty-three million, four hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •