Base | Representation |
---|---|
bin | 100100101011011011001… |
… | …0000110100010010110101 |
3 | 122211220211202101211000000 |
4 | 1021112312100310102311 |
5 | 1130043034423000041 |
6 | 14415454540541513 |
7 | 1030130013153051 |
oct | 111266620642265 |
9 | 18756752354000 |
10 | 5041054500021 |
11 | 1673998933021 |
12 | 694ba6b51899 |
13 | 2a74a5756427 |
14 | 135dba00ac61 |
15 | 8b1e1aa2bb6 |
hex | 495b64344b5 |
5041054500021 has 56 divisors (see below), whose sum is σ = 7992227255040. Its totient is φ = 3172968417600.
The previous prime is 5041054500011. The next prime is 5041054500049. The reversal of 5041054500021 is 1200054501405.
5041054500021 is a `hidden beast` number, since 50 + 4 + 105 + 4 + 500 + 0 + 2 + 1 = 666.
5041054500021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5041054500021 - 213 = 5041054491829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5041054500011) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1793751 + ... + 3646868.
It is an arithmetic number, because the mean of its divisors is an integer number (142718343840).
Almost surely, 25041054500021 is an apocalyptic number.
It is an amenable number.
5041054500021 is a deficient number, since it is larger than the sum of its proper divisors (2951172755019).
5041054500021 is an equidigital number, since it uses as much as digits as its factorization.
5041054500021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5440709 (or 5440694 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 5041054500021 in words is "five trillion, forty-one billion, fifty-four million, five hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •