Base | Representation |
---|---|
bin | 10110000111101010010… |
… | …110001010001101101001 |
3 | 12101022112020220110021111 |
4 | 112013222112022031221 |
5 | 144401033103224113 |
6 | 3122145332510321 |
7 | 214551245306113 |
oct | 26075226121551 |
9 | 5338466813244 |
10 | 1520055133033 |
11 | 5367195496a8 |
12 | 20671b47b3a1 |
13 | b0457355b28 |
14 | 537dcdc43b3 |
15 | 29817da613d |
hex | 161ea58a369 |
1520055133033 has 8 divisors (see below), whose sum is σ = 1521566673480. Its totient is φ = 1518544325760.
The previous prime is 1520055133001. The next prime is 1520055133067. The reversal of 1520055133033 is 3303315500251.
It can be written as a sum of positive squares in 4 ways, for example, as 1291161781849 + 228893351184 = 1136293^2 + 478428^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 1520055133033 - 25 = 1520055133001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1520055132986 and 1520055133004.
It is not an unprimeable number, because it can be changed into a prime (1520055133733) 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, 4012863 + ... + 4375291.
It is an arithmetic number, because the mean of its divisors is an integer number (190195834185).
Almost surely, 21520055133033 is an apocalyptic number.
It is an amenable number.
1520055133033 is a deficient number, since it is larger than the sum of its proper divisors (1511540447).
1520055133033 is a wasteful number, since it uses less digits than its factorization.
1520055133033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 366587.
The product of its (nonzero) digits is 20250, while the sum is 31.
The spelling of 1520055133033 in words is "one trillion, five hundred twenty billion, fifty-five million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •