Base | Representation |
---|---|
bin | 100100011000110100011… |
… | …0010011111111011110110 |
3 | 122201002201020221222010111 |
4 | 1020301220302133323312 |
5 | 1123414223100013024 |
6 | 14345250145213234 |
7 | 1024213630421155 |
oct | 110615062377366 |
9 | 18632636858114 |
10 | 5001100001014 |
11 | 1658a55632607 |
12 | 6892b633121a |
13 | 2a37a8c45540 |
14 | 1340a98c559c |
15 | 8a1540a7a94 |
hex | 48c68c9fef6 |
5001100001014 has 16 divisors (see below), whose sum is σ = 8078742271152. Its totient is φ = 2308187923488.
The previous prime is 5001100001011. The next prime is 5001100001039. The reversal of 5001100001014 is 4101000011005.
It is a super-2 number, since 2×50011000010142 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 5001100000985 and 5001100001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001100001011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6293857 + ... + 7043779.
It is an arithmetic number, because the mean of its divisors is an integer number (504921391947).
Almost surely, 25001100001014 is an apocalyptic number.
5001100001014 is a deficient number, since it is larger than the sum of its proper divisors (3077642270138).
5001100001014 is a wasteful number, since it uses less digits than its factorization.
5001100001014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006431.
The product of its (nonzero) digits is 20, while the sum is 13.
Adding to 5001100001014 its reverse (4101000011005), we get a palindrome (9102100012019).
Subtracting from 5001100001014 its reverse (4101000011005), we obtain a palindrome (900099990009).
The spelling of 5001100001014 in words is "five trillion, one billion, one hundred million, one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •