Base | Representation |
---|---|
bin | 1011100110111100101011… |
… | …0010110010111101111111 |
3 | 1200012012110200201122222121 |
4 | 2321233022302302331333 |
5 | 3133110130014300030 |
6 | 43051330314223411 |
7 | 2455102425121504 |
oct | 271571262627577 |
9 | 50165420648877 |
10 | 12763750150015 |
11 | 4081092233797 |
12 | 152184a124b67 |
13 | 717802519087 |
14 | 321aa984d4ab |
15 | 172033a9b47a |
hex | b9bcacb2f7f |
12763750150015 has 12 divisors (see below), whose sum is σ = 16165059749064. Its totient is φ = 9673579059696.
The previous prime is 12763750150013. The next prime is 12763750150033. The reversal of 12763750150015 is 51005105736721.
It is not a de Polignac number, because 12763750150015 - 21 = 12763750150013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12763750150013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3535663057 + ... + 3535666666.
It is an arithmetic number, because the mean of its divisors is an integer number (1347088312422).
Almost surely, 212763750150015 is an apocalyptic number.
12763750150015 is a deficient number, since it is larger than the sum of its proper divisors (3401309599049).
12763750150015 is an equidigital number, since it uses as much as digits as its factorization.
12763750150015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7071329766 (or 7071329747 counting only the distinct ones).
The product of its (nonzero) digits is 220500, while the sum is 43.
Adding to 12763750150015 its reverse (51005105736721), we get a palindrome (63768855886736).
The spelling of 12763750150015 in words is "twelve trillion, seven hundred sixty-three billion, seven hundred fifty million, one hundred fifty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •