Base | Representation |
---|---|
bin | 100110100101001011011… |
… | …0101010110010001100101 |
3 | 200202220201202021010002011 |
4 | 1031022112311112101211 |
5 | 1143334030133214113 |
6 | 15135535534314221 |
7 | 1055044252060210 |
oct | 115122665262145 |
9 | 20686652233064 |
10 | 5302520210533 |
11 | 1764871471287 |
12 | 7177b7358971 |
13 | 2c604407a4c0 |
14 | 1449014ba777 |
15 | 92de629e63d |
hex | 4d296d56465 |
5302520210533 has 16 divisors (see below), whose sum is σ = 6540153459840. Its totient is φ = 4186416845376.
The previous prime is 5302520210531. The next prime is 5302520210557. The reversal of 5302520210533 is 3350120252035.
It is a cyclic number.
It is not a de Polignac number, because 5302520210533 - 21 = 5302520210531 is a prime.
It is a super-2 number, since 2×53025202105332 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5302520210495 and 5302520210504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302520210531) 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, 62344498 + ... + 62429491.
It is an arithmetic number, because the mean of its divisors is an integer number (408759591240).
Almost surely, 25302520210533 is an apocalyptic number.
It is an amenable number.
5302520210533 is a deficient number, since it is larger than the sum of its proper divisors (1237633249307).
5302520210533 is a wasteful number, since it uses less digits than its factorization.
5302520210533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124774476.
The product of its (nonzero) digits is 27000, while the sum is 31.
Adding to 5302520210533 its reverse (3350120252035), we get a palindrome (8652640462568).
The spelling of 5302520210533 in words is "five trillion, three hundred two billion, five hundred twenty million, two hundred ten thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •