Base | Representation |
---|---|
bin | 10001101011101100000… |
… | …001010000100000101101 |
3 | 11022011111020021201220000 |
4 | 101223230001100200231 |
5 | 124402101433431341 |
6 | 2330121114414513 |
7 | 153535213041402 |
oct | 21535401204055 |
9 | 4264436251800 |
10 | 1215140530221 |
11 | 42937a172592 |
12 | 177604131439 |
13 | 8a783298527 |
14 | 42b552902a9 |
15 | 2191e00d8b6 |
hex | 11aec05082d |
1215140530221 has 40 divisors (see below), whose sum is σ = 1868322086400. Its totient is φ = 786726963360.
The previous prime is 1215140530049. The next prime is 1215140530229. The reversal of 1215140530221 is 1220350415121.
It is a happy number.
1215140530221 is a `hidden beast` number, since 1 + 2 + 1 + 5 + 1 + 405 + 30 + 221 = 666.
It is not a de Polignac number, because 1215140530221 - 214 = 1215140513837 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1215140530229) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1166181 + ... + 1946858.
It is an arithmetic number, because the mean of its divisors is an integer number (46708052160).
Almost surely, 21215140530221 is an apocalyptic number.
It is an amenable number.
1215140530221 is a deficient number, since it is larger than the sum of its proper divisors (653181556179).
1215140530221 is an equidigital number, since it uses as much as digits as its factorization.
1215140530221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3113191 (or 3113182 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 1215140530221 its reverse (1220350415121), we get a palindrome (2435490945342).
The spelling of 1215140530221 in words is "one trillion, two hundred fifteen billion, one hundred forty million, five hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •