Base | Representation |
---|---|
bin | 10001101010000111010… |
… | …001001111011111000001 |
3 | 11022000010102200011020111 |
4 | 101222013101033133001 |
5 | 124340121224042010 |
6 | 2325241253311321 |
7 | 153445266461554 |
oct | 21520721173701 |
9 | 4260112604214 |
10 | 1213450221505 |
11 | 428692019635 |
12 | 177212035541 |
13 | 8a574033162 |
14 | 42a349ac69b |
15 | 2187092158a |
hex | 11a8744f7c1 |
1213450221505 has 8 divisors (see below), whose sum is σ = 1456222839912. Its totient is φ = 970705127808.
The previous prime is 1213450221491. The next prime is 1213450221559. The reversal of 1213450221505 is 5051220543121.
It can be written as a sum of positive squares in 4 ways, for example, as 57461842944 + 1155988378561 = 239712^2 + 1075169^2 .
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 1213450221505 - 233 = 1204860286913 is a prime.
It is a super-2 number, since 2×12134502215052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6784062 + ... + 6960631.
It is an arithmetic number, because the mean of its divisors is an integer number (182027854989).
Almost surely, 21213450221505 is an apocalyptic number.
It is an amenable number.
1213450221505 is a deficient number, since it is larger than the sum of its proper divisors (242772618407).
1213450221505 is a wasteful number, since it uses less digits than its factorization.
1213450221505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13762355.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 1213450221505 its reverse (5051220543121), we get a palindrome (6264670764626).
The spelling of 1213450221505 in words is "one trillion, two hundred thirteen billion, four hundred fifty million, two hundred twenty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •