Base | Representation |
---|---|
bin | 100100011010101000110… |
… | …0001100001110101000010 |
3 | 122201110210101020100212102 |
4 | 1020311101201201311002 |
5 | 1124000222142044100 |
6 | 14351133431230402 |
7 | 1024412452350014 |
oct | 110652141416502 |
9 | 18643711210772 |
10 | 5005004643650 |
11 | 165a6797063a0 |
12 | 68a005b18402 |
13 | 2a3c7bb8a67b |
14 | 13435a2d61b4 |
15 | 8a2d1c93cd5 |
hex | 48d51861d42 |
5005004643650 has 96 divisors (see below), whose sum is σ = 10746415328256. Its totient is φ = 1716351560000.
The previous prime is 5005004643629. The next prime is 5005004643659. The reversal of 5005004643650 is 563464005005.
It is a happy number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5005004643659) 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 47 ways as a sum of consecutive naturals, for example, 1888136 + ... + 3684435.
It is an arithmetic number, because the mean of its divisors is an integer number (111941826336).
Almost surely, 25005004643650 is an apocalyptic number.
5005004643650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5005004643650 is an abundant number, since it is smaller than the sum of its proper divisors (5741410684606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005004643650 is a wasteful number, since it uses less digits than its factorization.
5005004643650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5572688 (or 5572683 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 5005004643650 its reverse (563464005005), we get a palindrome (5568468648655).
The spelling of 5005004643650 in words is "five trillion, five billion, four million, six hundred forty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •