Base | Representation |
---|---|
bin | 10110000111101010000… |
… | …111111110100001010001 |
3 | 12101022111222220120021001 |
4 | 112013222013332201101 |
5 | 144401031130240441 |
6 | 3122145121102001 |
7 | 214551201562531 |
oct | 26075207764121 |
9 | 5338458816231 |
10 | 1520051415121 |
11 | 53671743a348 |
12 | 20671a187901 |
13 | b0456653795 |
14 | 537dc6d74c1 |
15 | 298178be731 |
hex | 161ea1fe851 |
1520051415121 has 16 divisors (see below), whose sum is σ = 1606250793600. Its totient is φ = 1434474921600.
The previous prime is 1520051415059. The next prime is 1520051415133. The reversal of 1520051415121 is 1215141500251.
It is a cyclic number.
It is not a de Polignac number, because 1520051415121 - 235 = 1485691676753 is a prime.
It is a super-2 number, since 2×15200514151212 (a number of 25 digits) contains 22 as substring.
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 1520051415121.
It is not an unprimeable number, because it can be changed into a prime (1520051415191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17677251 + ... + 17763031.
It is an arithmetic number, because the mean of its divisors is an integer number (100390674600).
Almost surely, 21520051415121 is an apocalyptic number.
It is an amenable number.
1520051415121 is a deficient number, since it is larger than the sum of its proper divisors (86199378479).
1520051415121 is a wasteful number, since it uses less digits than its factorization.
1520051415121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89400.
The product of its (nonzero) digits is 2000, while the sum is 28.
Adding to 1520051415121 its reverse (1215141500251), we get a palindrome (2735192915372).
The spelling of 1520051415121 in words is "one trillion, five hundred twenty billion, fifty-one million, four hundred fifteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •