Base | Representation |
---|---|
bin | 100111100001111… |
… | …1101111001001101 |
3 | 10102102221010121220 |
4 | 1033003331321031 |
5 | 10204032040023 |
6 | 335342113553 |
7 | 44604361023 |
oct | 11703757115 |
9 | 3372833556 |
10 | 1326440013 |
11 | 620817018 |
12 | 31027b8b9 |
13 | 181a64762 |
14 | c8244713 |
15 | 7b6b43e3 |
hex | 4f0fde4d |
1326440013 has 4 divisors (see below), whose sum is σ = 1768586688. Its totient is φ = 884293340.
The previous prime is 1326439999. The next prime is 1326440023. The reversal of 1326440013 is 3100446231.
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.
It is a cyclic number.
It is not a de Polignac number, because 1326440013 - 26 = 1326439949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1326440023) 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, 221073333 + ... + 221073338.
It is an arithmetic number, because the mean of its divisors is an integer number (442146672).
Almost surely, 21326440013 is an apocalyptic number.
It is an amenable number.
1326440013 is a deficient number, since it is larger than the sum of its proper divisors (442146675).
1326440013 is an equidigital number, since it uses as much as digits as its factorization.
1326440013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442146674.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 1326440013 is about 36420.3241748340. The cubic root of 1326440013 is about 1098.7423679290.
Adding to 1326440013 its reverse (3100446231), we get a palindrome (4426886244).
The spelling of 1326440013 in words is "one billion, three hundred twenty-six million, four hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •