Base | Representation |
---|---|
bin | 1011110010001001100… |
… | …1010001011001011011 |
3 | 201100112102112121010001 |
4 | 2330202121101121123 |
5 | 11304044232404430 |
6 | 232555550433431 |
7 | 20424443653411 |
oct | 2744231213133 |
9 | 640472477101 |
10 | 202440513115 |
11 | 78944434895 |
12 | 33298b02877 |
13 | 16122b21089 |
14 | 9b262892b1 |
15 | 53ec84e3ca |
hex | 2f2265165b |
202440513115 has 8 divisors (see below), whose sum is σ = 243061884288. Its totient is φ = 161863564800.
The previous prime is 202440513071. The next prime is 202440513133. The reversal of 202440513115 is 511315044202.
202440513115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202440513115 - 219 = 202439988827 is a prime.
It is a super-2 number, since 2×2024405131152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11095686 + ... + 11113915.
It is an arithmetic number, because the mean of its divisors is an integer number (30382735536).
Almost surely, 2202440513115 is an apocalyptic number.
202440513115 is a deficient number, since it is larger than the sum of its proper divisors (40621371173).
202440513115 is a wasteful number, since it uses less digits than its factorization.
202440513115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22211429.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 202440513115 its reverse (511315044202), we get a palindrome (713755557317).
The spelling of 202440513115 in words is "two hundred two billion, four hundred forty million, five hundred thirteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •