Base | Representation |
---|---|
bin | 10100100101111101010… |
… | …101010000100010001011 |
3 | 12000021202000200100102102 |
4 | 110211331111100202023 |
5 | 141141210110341011 |
6 | 3002035354424015 |
7 | 204145442506154 |
oct | 24457525204213 |
9 | 5007660610372 |
10 | 1415146965131 |
11 | 4a6184629399 |
12 | 1aa321a3200b |
13 | a35a8a2b633 |
14 | 4c6ca16892b |
15 | 26c27d0473b |
hex | 1497d55088b |
1415146965131 has 4 divisors (see below), whose sum is σ = 1460796867264. Its totient is φ = 1369497063000.
The previous prime is 1415146965107. The next prime is 1415146965149. The reversal of 1415146965131 is 1315696415141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1415146965131 is a prime.
It is a super-4 number, since 4×14151469651314 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1415146965181) 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, 22824951020 + ... + 22824951081.
It is an arithmetic number, because the mean of its divisors is an integer number (365199216816).
Almost surely, 21415146965131 is an apocalyptic number.
1415146965131 is a deficient number, since it is larger than the sum of its proper divisors (45649902133).
1415146965131 is an equidigital number, since it uses as much as digits as its factorization.
1415146965131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45649902132.
The product of its digits is 388800, while the sum is 47.
The spelling of 1415146965131 in words is "one trillion, four hundred fifteen billion, one hundred forty-six million, nine hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •