Base | Representation |
---|---|
bin | 1001001101110101001110… |
… | …11101011101101011000011 |
3 | 2122202110021210210021020200 |
4 | 10212322213131131223003 |
5 | 10124021210044040230 |
6 | 111034141404340243 |
7 | 4161126621025215 |
oct | 446724735355303 |
9 | 78673253707220 |
10 | 20266465221315 |
11 | 6503a612a9805 |
12 | 233393a244683 |
13 | b40172624b21 |
14 | 500c8b7025b5 |
15 | 25229d43e160 |
hex | 126ea775dac3 |
20266465221315 has 48 divisors (see below), whose sum is σ = 35240499167328. Its totient is φ = 10774346462208.
The previous prime is 20266465221311. The next prime is 20266465221413. The reversal of 20266465221315 is 51312256466202.
20266465221315 is a `hidden beast` number, since 2 + 0 + 2 + 66 + 46 + 522 + 13 + 15 = 666.
It is not a de Polignac number, because 20266465221315 - 22 = 20266465221311 is a prime.
It is a super-2 number, since 2×202664652213152 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (20266465221311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 70176004 + ... + 70464206.
It is an arithmetic number, because the mean of its divisors is an integer number (734177065986).
Almost surely, 220266465221315 is an apocalyptic number.
20266465221315 is a deficient number, since it is larger than the sum of its proper divisors (14974033946013).
20266465221315 is a wasteful number, since it uses less digits than its factorization.
20266465221315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293188 (or 293185 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 45.
The spelling of 20266465221315 in words is "twenty trillion, two hundred sixty-six billion, four hundred sixty-five million, two hundred twenty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •