Base | Representation |
---|---|
bin | 100100011100000111101… |
… | …1100010010111110010001 |
3 | 122201210000102211011000221 |
4 | 1020320033130102332101 |
5 | 1124023233340134441 |
6 | 14352421532513041 |
7 | 1024554432425602 |
oct | 110701734227621 |
9 | 18653012734027 |
10 | 5008190943121 |
11 | 1660a64251343 |
12 | 68a75501b781 |
13 | 2a4369040182 |
14 | 13457d555da9 |
15 | 8a41b8878d1 |
hex | 48e0f712f91 |
5008190943121 has 4 divisors (see below), whose sum is σ = 5008229740852. Its totient is φ = 5008152145392.
The previous prime is 5008190943101. The next prime is 5008190943169. The reversal of 5008190943121 is 1213490918005.
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 4387814173521 + 620376769600 = 2094711^2 + 787640^2 .
It is a cyclic number.
It is not a de Polignac number, because 5008190943121 - 25 = 5008190943089 is a prime.
It is a super-2 number, since 2×50081909431212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5008190943101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19204590 + ... + 19463623.
It is an arithmetic number, because the mean of its divisors is an integer number (1252057435213).
Almost surely, 25008190943121 is an apocalyptic number.
It is an amenable number.
5008190943121 is a deficient number, since it is larger than the sum of its proper divisors (38797731).
5008190943121 is a wasteful number, since it uses less digits than its factorization.
5008190943121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38797730.
The product of its (nonzero) digits is 77760, while the sum is 43.
The spelling of 5008190943121 in words is "five trillion, eight billion, one hundred ninety million, nine hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •