Base | Representation |
---|---|
bin | 1100000101100001… |
… | …1100110100110101 |
3 | 22101002221012212022 |
4 | 3001120130310311 |
5 | 23121032142323 |
6 | 1253535002525 |
7 | 143254022510 |
oct | 30130346465 |
9 | 8332835768 |
10 | 3244412213 |
11 | 1415427a09 |
12 | 766669445 |
13 | 3c921b753 |
14 | 22ac69d77 |
15 | 13ec724c8 |
hex | c161cd35 |
3244412213 has 4 divisors (see below), whose sum is σ = 3707899680. Its totient is φ = 2780924748.
The previous prime is 3244412191. The next prime is 3244412251. The reversal of 3244412213 is 3122144423.
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: 3122144423 = 211 ⋅14796893.
It is not a de Polignac number, because 3244412213 - 28 = 3244411957 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 (3244412273) 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, 231743723 + ... + 231743736.
It is an arithmetic number, because the mean of its divisors is an integer number (926974920).
Almost surely, 23244412213 is an apocalyptic number.
It is an amenable number.
3244412213 is a deficient number, since it is larger than the sum of its proper divisors (463487467).
3244412213 is an equidigital number, since it uses as much as digits as its factorization.
3244412213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463487466.
The product of its digits is 4608, while the sum is 26.
The square root of 3244412213 is about 56959.7420376883. The cubic root of 3244412213 is about 1480.3986345536.
Adding to 3244412213 its reverse (3122144423), we get a palindrome (6366556636).
The spelling of 3244412213 in words is "three billion, two hundred forty-four million, four hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •