Base | Representation |
---|---|
bin | 100100101011000001101… |
… | …1010111100000000000101 |
3 | 122211211122022100200112200 |
4 | 1021112003122330000011 |
5 | 1130034313041440023 |
6 | 14415234150305113 |
7 | 1030066615000230 |
oct | 111260332740005 |
9 | 18754568320480 |
10 | 5040201515013 |
11 | 16735a03a2835 |
12 | 6949a9358199 |
13 | 2a739ab11582 |
14 | 135d38a0c417 |
15 | 8b191c61743 |
hex | 495836bc005 |
5040201515013 has 12 divisors (see below), whose sum is σ = 8320332659808. Its totient is φ = 2880115151400.
The previous prime is 5040201514987. The next prime is 5040201515023. The reversal of 5040201515013 is 3105151020405.
5040201515013 is a `hidden beast` number, since 5 + 0 + 4 + 0 + 2 + 0 + 151 + 501 + 3 = 666.
It is not a de Polignac number, because 5040201515013 - 29 = 5040201514501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5040201515023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40001599263 + ... + 40001599388.
It is an arithmetic number, because the mean of its divisors is an integer number (693361054984).
Almost surely, 25040201515013 is an apocalyptic number.
It is an amenable number.
5040201515013 is a deficient number, since it is larger than the sum of its proper divisors (3280131144795).
5040201515013 is a wasteful number, since it uses less digits than its factorization.
5040201515013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80003198664 (or 80003198661 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 5040201515013 its reverse (3105151020405), we get a palindrome (8145352535418).
The spelling of 5040201515013 in words is "five trillion, forty billion, two hundred one million, five hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •