Base | Representation |
---|---|
bin | 100101000110111000001… |
… | …0110000001010100001011 |
3 | 200001120000112110101100000 |
4 | 1022031300112001110023 |
5 | 1132024310304013344 |
6 | 14502525051214043 |
7 | 1034315012146620 |
oct | 112156026012413 |
9 | 20046015411300 |
10 | 5100011001099 |
11 | 16969a2286983 |
12 | 6a44bb447323 |
13 | 2acc0cc56121 |
14 | 138bb006c347 |
15 | 8c9e28d0a69 |
hex | 4a37058150b |
5100011001099 has 24 divisors (see below), whose sum is σ = 8730883033600. Its totient is φ = 2914291999656.
The previous prime is 5100011001067. The next prime is 5100011001109. The reversal of 5100011001099 is 9901001100015.
It is not a de Polignac number, because 5100011001099 - 25 = 5100011001067 is a prime.
It is a super-2 number, since 2×51000110010992 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5100011001049) 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 23 ways as a sum of consecutive naturals, for example, 1499119699 + ... + 1499123100.
Almost surely, 25100011001099 is an apocalyptic number.
5100011001099 is a deficient number, since it is larger than the sum of its proper divisors (3630872032501).
5100011001099 is an equidigital number, since it uses as much as digits as its factorization.
5100011001099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2998242821 (or 2998242809 counting only the distinct ones).
The product of its (nonzero) digits is 405, while the sum is 27.
The spelling of 5100011001099 in words is "five trillion, one hundred billion, eleven million, one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •