Base | Representation |
---|---|
bin | 100111100001101… |
… | …1111011010000101 |
3 | 10102102200210100000 |
4 | 1033003133122011 |
5 | 10204014041031 |
6 | 335335311513 |
7 | 44603330664 |
oct | 11703373205 |
9 | 3372623300 |
10 | 1326315141 |
11 | 620741218 |
12 | 31021b599 |
13 | 181a1c978 |
14 | c8210ddb |
15 | 7b68c3e6 |
hex | 4f0df685 |
1326315141 has 24 divisors (see below), whose sum is σ = 1991429440. Its totient is φ = 882124992.
The previous prime is 1326315097. The next prime is 1326315149. The reversal of 1326315141 is 1415136231.
It is a happy number.
1326315141 is a `hidden beast` number, since 13 + 2 + 631 + 5 + 14 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-1326315141 is a prime.
It is a super-2 number, since 2×13263151412 = 3518223706491699762, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1326315149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100461 + ... + 112893.
Almost surely, 21326315141 is an apocalyptic number.
It is an amenable number.
1326315141 is a deficient number, since it is larger than the sum of its proper divisors (665114299).
1326315141 is an equidigital number, since it uses as much as digits as its factorization.
1326315141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12887 (or 12875 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
The square root of 1326315141 is about 36418.6098169603. The cubic root of 1326315141 is about 1098.7078880527.
The spelling of 1326315141 in words is "one billion, three hundred twenty-six million, three hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •