Base | Representation |
---|---|
bin | 1001010101110111… |
… | …01110001110011001 |
3 | 110221112002220212001 |
4 | 10222323232032121 |
5 | 40232402004301 |
6 | 2145354321001 |
7 | 235166026231 |
oct | 45273561631 |
9 | 13845086761 |
10 | 5015266201 |
11 | 2143a94800 |
12 | b7b729161 |
13 | 61c07544a |
14 | 358116cc1 |
15 | 1e546ec01 |
hex | 12aeee399 |
5015266201 has 24 divisors (see below), whose sum is σ = 5860512000. Its totient is φ = 4276404000.
The previous prime is 5015266183. The next prime is 5015266241. The reversal of 5015266201 is 1026625105.
It is not a de Polignac number, because 5015266201 - 27 = 5015266073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5015266201.
It is not an unprimeable number, because it can be changed into a prime (5015266241) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 221400 + ... + 242998.
It is an arithmetic number, because the mean of its divisors is an integer number (244188000).
Almost surely, 25015266201 is an apocalyptic number.
It is an amenable number.
5015266201 is a deficient number, since it is larger than the sum of its proper divisors (845245799).
5015266201 is a wasteful number, since it uses less digits than its factorization.
5015266201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21741 (or 21730 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 5015266201 is about 70818.5441886516. The cubic root of 5015266201 is about 1711.7145009013.
It can be divided in two parts, 5015 and 266201, that added together give a triangular number (271216 = T736).
The spelling of 5015266201 in words is "five billion, fifteen million, two hundred sixty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •