Base | Representation |
---|---|
bin | 1001010101001101100100… |
… | …10011110100010010011010 |
3 | 2200122200211120212121201020 |
4 | 10222212302103310102122 |
5 | 10142200030334443341 |
6 | 111350440405103310 |
7 | 4215344655523344 |
oct | 452466223642232 |
9 | 80580746777636 |
10 | 20520050312346 |
11 | 65a1560498a02 |
12 | 2374b0b3b7b36 |
13 | b5b056373a50 |
14 | 50d266302294 |
15 | 258b90d72566 |
hex | 12a9b24f449a |
20520050312346 has 32 divisors (see below), whose sum is σ = 44200357510848. Its totient is φ = 6313386481920.
The previous prime is 20520050312341. The next prime is 20520050312347. The reversal of 20520050312346 is 64321305002502.
It is a happy number.
It is a super-2 number, since 2×205200503123462 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20520050312341) 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, 8855200 + ... + 10929531.
It is an arithmetic number, because the mean of its divisors is an integer number (1381261172214).
Almost surely, 220520050312346 is an apocalyptic number.
20520050312346 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
20520050312346 is an abundant number, since it is smaller than the sum of its proper divisors (23680307198502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20520050312346 is a wasteful number, since it uses less digits than its factorization.
20520050312346 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19798046.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 20520050312346 its reverse (64321305002502), we get a palindrome (84841355314848).
The spelling of 20520050312346 in words is "twenty trillion, five hundred twenty billion, fifty million, three hundred twelve thousand, three hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •