Base | Representation |
---|---|
bin | 100100011000110010100… |
… | …1111100001101011011001 |
3 | 122201002120010000002002111 |
4 | 1020301211033201223121 |
5 | 1123414112332021330 |
6 | 14345240222032321 |
7 | 1024212305610121 |
oct | 110614517415331 |
9 | 18632503002074 |
10 | 5001040501465 |
11 | 1658a24a93728 |
12 | 68929a4186a1 |
13 | 2a37998122c8 |
14 | 1340a1a37c81 |
15 | 8a14dc5332a |
hex | 48c653e1ad9 |
5001040501465 has 4 divisors (see below), whose sum is σ = 6001248601764. Its totient is φ = 4000832401168.
The previous prime is 5001040501453. The next prime is 5001040501481. The reversal of 5001040501465 is 5641050401005.
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 2082655945881 + 2918384555584 = 1443141^2 + 1708328^2 .
It is a cyclic number.
It is not a de Polignac number, because 5001040501465 - 217 = 5001040370393 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500104050142 + ... + 500104050151.
It is an arithmetic number, because the mean of its divisors is an integer number (1500312150441).
Almost surely, 25001040501465 is an apocalyptic number.
It is an amenable number.
5001040501465 is a deficient number, since it is larger than the sum of its proper divisors (1000208100299).
5001040501465 is a wasteful number, since it uses less digits than its factorization.
5001040501465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000208100298.
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 5001040501465 in words is "five trillion, one billion, forty million, five hundred one thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •