Base | Representation |
---|---|
bin | 100100111111010010011… |
… | …1101111110011100110001 |
3 | 122222222221202211000122202 |
4 | 1021332210331332130301 |
5 | 1131242421242134134 |
6 | 14451232002312545 |
7 | 1033200113125610 |
oct | 111764475763461 |
9 | 18888852730582 |
10 | 5083714021169 |
11 | 168aa9a03a723 |
12 | 6a1311658755 |
13 | 2ab5137bb934 |
14 | 1380a58b1877 |
15 | 8c38bcc5d7e |
hex | 49fa4f7e731 |
5083714021169 has 8 divisors (see below), whose sum is σ = 6115746191040. Its totient is φ = 4128128678736.
The previous prime is 5083714021151. The next prime is 5083714021247. The reversal of 5083714021169 is 9611204173805.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5083714021169 - 236 = 5014994544433 is a prime.
It is a super-2 number, since 2×50837140211692 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5083714021129) 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, 19111706714 + ... + 19111706979.
It is an arithmetic number, because the mean of its divisors is an integer number (764468273880).
It is a 1-persistent number, because it is pandigital, but 2⋅5083714021169 = 10167428042338 is not.
Almost surely, 25083714021169 is an apocalyptic number.
It is an amenable number.
5083714021169 is a deficient number, since it is larger than the sum of its proper divisors (1032032169871).
5083714021169 is a wasteful number, since it uses less digits than its factorization.
5083714021169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38223413719.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 5083714021169 in words is "five trillion, eighty-three billion, seven hundred fourteen million, twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •