Base | Representation |
---|---|
bin | 100100011111011011101… |
… | …1011111110110101001001 |
3 | 122202110101012001012200021 |
4 | 1020332313123332311021 |
5 | 1124132320411301301 |
6 | 14355555442540441 |
7 | 1025225630005534 |
oct | 110766733766511 |
9 | 18673335035607 |
10 | 5015304400201 |
11 | 1663a84648997 |
12 | 68bbbb367721 |
13 | 2a4c309bbb84 |
14 | 134a561a7a1b |
15 | 8a6d61138a1 |
hex | 48fb76fed49 |
5015304400201 has 4 divisors (see below), whose sum is σ = 5150853167812. Its totient is φ = 4879755632592.
The previous prime is 5015304400187. The next prime is 5015304400213. The reversal of 5015304400201 is 1020044035105.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1950634015801 + 3064670384400 = 1396651^2 + 1750620^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5015304400201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5015304400801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67774383750 + ... + 67774383823.
It is an arithmetic number, because the mean of its divisors is an integer number (1287713291953).
Almost surely, 25015304400201 is an apocalyptic number.
It is an amenable number.
5015304400201 is a deficient number, since it is larger than the sum of its proper divisors (135548767611).
5015304400201 is a wasteful number, since it uses less digits than its factorization.
5015304400201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135548767610.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5015304400201 its reverse (1020044035105), we get a palindrome (6035348435306).
The spelling of 5015304400201 in words is "five trillion, fifteen billion, three hundred four million, four hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •