Base | Representation |
---|---|
bin | 10001101011101011111… |
… | …111101111111001100101 |
3 | 11022011111012112122001201 |
4 | 101223223333233321211 |
5 | 124402101333301001 |
6 | 2330121102122501 |
7 | 153535206502606 |
oct | 21535377577145 |
9 | 4264435478051 |
10 | 1215140134501 |
11 | 429379a22247 |
12 | 177603b80431 |
13 | 8a78318a387 |
14 | 42b551c9dad |
15 | 2191de81501 |
hex | 11aebfefe65 |
1215140134501 has 8 divisors (see below), whose sum is σ = 1221412452480. Its totient is φ = 1208868868368.
The previous prime is 1215140134493. The next prime is 1215140134511. The reversal of 1215140134501 is 1054310415121.
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 not a de Polignac number, because 1215140134501 - 23 = 1215140134493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1215140134501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1215140134511) 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, 2108520 + ... + 2622238.
It is an arithmetic number, because the mean of its divisors is an integer number (152676556560).
Almost surely, 21215140134501 is an apocalyptic number.
It is an amenable number.
1215140134501 is a deficient number, since it is larger than the sum of its proper divisors (6272317979).
1215140134501 is a wasteful number, since it uses less digits than its factorization.
1215140134501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 525923.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 1215140134501 its reverse (1054310415121), we get a palindrome (2269450549622).
The spelling of 1215140134501 in words is "one trillion, two hundred fifteen billion, one hundred forty million, one hundred thirty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •