Base | Representation |
---|---|
bin | 100100011000110011000… |
… | …0111001101110010111111 |
3 | 122201002121010110202122111 |
4 | 1020301212013031302333 |
5 | 1123414130101200340 |
6 | 14345241502554451 |
7 | 1024212543651535 |
oct | 110614607156277 |
9 | 18632533422574 |
10 | 5001055100095 |
11 | 1658a3225490a |
12 | 6892a3298a27 |
13 | 2a379c854052 |
14 | 1340a3958155 |
15 | 8a150188aea |
hex | 48c661cdcbf |
5001055100095 has 32 divisors (see below), whose sum is σ = 6277585996800. Its totient is φ = 3817497682944.
The previous prime is 5001055100087. The next prime is 5001055100189. The reversal of 5001055100095 is 5900015501005.
It is not a de Polignac number, because 5001055100095 - 23 = 5001055100087 is a prime.
It is a super-2 number, since 2×50010551000952 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78069199 + ... + 78133231.
It is an arithmetic number, because the mean of its divisors is an integer number (196174562400).
Almost surely, 25001055100095 is an apocalyptic number.
5001055100095 is a deficient number, since it is larger than the sum of its proper divisors (1276530896705).
5001055100095 is a wasteful number, since it uses less digits than its factorization.
5001055100095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65719.
The product of its (nonzero) digits is 5625, while the sum is 31.
The spelling of 5001055100095 in words is "five trillion, one billion, fifty-five million, one hundred thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •