Base | Representation |
---|---|
bin | 10111100011010110… |
… | …11111101000001101 |
3 | 1012122020010112120121 |
4 | 23301223133220031 |
5 | 201344012123024 |
6 | 5450414344541 |
7 | 625226466235 |
oct | 136153375015 |
9 | 35566115517 |
10 | 12644645389 |
11 | 53a9633262 |
12 | 254a7bb151 |
13 | 12668924bc |
14 | 87d4a6cc5 |
15 | 4e015b8e4 |
hex | 2f1adfa0d |
12644645389 has 4 divisors (see below), whose sum is σ = 12760651420. Its totient is φ = 12528639360.
The previous prime is 12644645381. The next prime is 12644645413. The reversal of 12644645389 is 98354644621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 98354644621 = 5059 ⋅19441519.
It can be written as a sum of positive squares in 2 ways, for example, as 3052010025 + 9592635364 = 55245^2 + 97942^2 .
It is a cyclic number.
It is not a de Polignac number, because 12644645389 - 23 = 12644645381 is a prime.
It is a super-2 number, since 2×126446453892 (a number of 21 digits) 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 (12644645381) 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, 58002852 + ... + 58003069.
It is an arithmetic number, because the mean of its divisors is an integer number (3190162855).
Almost surely, 212644645389 is an apocalyptic number.
It is an amenable number.
12644645389 is a deficient number, since it is larger than the sum of its proper divisors (116006031).
12644645389 is a wasteful number, since it uses less digits than its factorization.
12644645389 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116006030.
The product of its digits is 4976640, while the sum is 52.
The spelling of 12644645389 in words is "twelve billion, six hundred forty-four million, six hundred forty-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •