Base | Representation |
---|---|
bin | 1011111101000010101011… |
… | …1010111000100110010111 |
3 | 1201112111012120101010201101 |
4 | 2333100222322320212113 |
5 | 3210320004410130030 |
6 | 43541542521410531 |
7 | 2524400502502534 |
oct | 277205272704627 |
9 | 51474176333641 |
10 | 13143320005015 |
11 | 4208061551832 |
12 | 158331b339a47 |
13 | 744543315205 |
14 | 3361d6559d8b |
15 | 17bd4baad7ca |
hex | bf42aeb8997 |
13143320005015 has 8 divisors (see below), whose sum is σ = 15772006407600. Its totient is φ = 10514641069632.
The previous prime is 13143320004967. The next prime is 13143320005019. The reversal of 13143320005015 is 51050002334131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13143320005015 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13143320005019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3311172 + ... + 6103318.
It is an arithmetic number, because the mean of its divisors is an integer number (1971500800950).
Almost surely, 213143320005015 is an apocalyptic number.
13143320005015 is a deficient number, since it is larger than the sum of its proper divisors (2628686402585).
13143320005015 is an equidigital number, since it uses as much as digits as its factorization.
13143320005015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3733601.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 13143320005015 its reverse (51050002334131), we get a palindrome (64193322339146).
The spelling of 13143320005015 in words is "thirteen trillion, one hundred forty-three billion, three hundred twenty million, five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •