Base | Representation |
---|---|
bin | 1001000111100010011011… |
… | …11100100001101100010101 |
3 | 2121222210002221221100102121 |
4 | 10203301031330201230111 |
5 | 10112000320023100010 |
6 | 110350535220535541 |
7 | 4136403006633400 |
oct | 443611574415425 |
9 | 77883087840377 |
10 | 20050215050005 |
11 | 6430280762368 |
12 | 22b9a485515b1 |
13 | b2595b77a08a |
14 | 4d461536ad37 |
15 | 24b8435593da |
hex | 123c4df21b15 |
20050215050005 has 36 divisors (see below), whose sum is σ = 29258261610732. Its totient is φ = 13150948419840.
The previous prime is 20050215049987. The next prime is 20050215050059. The reversal of 20050215050005 is 50005051205002.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2129098294449 + 17921116755556 = 1459143^2 + 4233334^2 .
It is not a de Polignac number, because 20050215050005 - 215 = 20050215017237 is a prime.
It is a super-2 number, since 2×200502150500052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 77221636 + ... + 77480845.
It is an arithmetic number, because the mean of its divisors is an integer number (812729489187).
Almost surely, 220050215050005 is an apocalyptic number.
It is an amenable number.
20050215050005 is a deficient number, since it is larger than the sum of its proper divisors (9208046560727).
20050215050005 is a wasteful number, since it uses less digits than its factorization.
20050215050005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154702546 (or 154702516 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 25.
Adding to 20050215050005 its reverse (50005051205002), we get a palindrome (70055266255007).
The spelling of 20050215050005 in words is "twenty trillion, fifty billion, two hundred fifteen million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •