Base | Representation |
---|---|
bin | 1011101100110101110… |
… | …0010110011110110101 |
3 | 201012212002200002022000 |
4 | 2323031130112132311 |
5 | 11243134401211023 |
6 | 232202314325513 |
7 | 20344226330664 |
oct | 2731534263665 |
9 | 635762602260 |
10 | 201015257013 |
11 | 7828296588a |
12 | 32b5b729899 |
13 | 15c5676b97c |
14 | 9a2cc80ddb |
15 | 536766b243 |
hex | 2ecd7167b5 |
201015257013 has 16 divisors (see below), whose sum is σ = 301994755200. Its totient is φ = 132122702880.
The previous prime is 201015256957. The next prime is 201015257021. The reversal of 201015257013 is 310752510102.
201015257013 is a `hidden beast` number, since 20 + 10 + 1 + 52 + 570 + 13 = 666.
It is not a de Polignac number, because 201015257013 - 212 = 201015252917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201015257033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52427728 + ... + 52431561.
It is an arithmetic number, because the mean of its divisors is an integer number (18874672200).
Almost surely, 2201015257013 is an apocalyptic number.
It is an amenable number.
201015257013 is a deficient number, since it is larger than the sum of its proper divisors (100979498187).
201015257013 is a wasteful number, since it uses less digits than its factorization.
201015257013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104859369 (or 104859363 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
Adding to 201015257013 its reverse (310752510102), we get a palindrome (511767767115).
The spelling of 201015257013 in words is "two hundred one billion, fifteen million, two hundred fifty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •