Base | Representation |
---|---|
bin | 100100100001101000101… |
… | …1000000101100010101111 |
3 | 122202220120211122220212212 |
4 | 1021003101120011202233 |
5 | 1124222012321212111 |
6 | 14402101054321035 |
7 | 1025454064442510 |
oct | 111032130054257 |
9 | 18686524586785 |
10 | 5020034554031 |
11 | 1665a916a7532 |
12 | 690abb4b917b |
13 | 2a5505979973 |
14 | 134d844a4a07 |
15 | 8a8b151598b |
hex | 490d16058af |
5020034554031 has 8 divisors (see below), whose sum is σ = 6039139313280. Its totient is φ = 4076419036248.
The previous prime is 5020034554021. The next prime is 5020034554061. The reversal of 5020034554031 is 1304554300205.
It is a happy number.
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 5020034554031 - 226 = 5019967445167 is a prime.
It is a super-2 number, since 2×50200345540312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020034554001) 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, 18872310221 + ... + 18872310486.
It is an arithmetic number, because the mean of its divisors is an integer number (754892414160).
Almost surely, 25020034554031 is an apocalyptic number.
5020034554031 is a deficient number, since it is larger than the sum of its proper divisors (1019104759249).
5020034554031 is a wasteful number, since it uses less digits than its factorization.
5020034554031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37744620733.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 5020034554031 its reverse (1304554300205), we get a palindrome (6324588854236).
The spelling of 5020034554031 in words is "five trillion, twenty billion, thirty-four million, five hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •