Base | Representation |
---|---|
bin | 100111010111011000001… |
… | …0001001010001111000011 |
3 | 201011012222120200102012101 |
4 | 1032232300101022033003 |
5 | 1202120314201122201 |
6 | 15301244530011231 |
7 | 1065611541453520 |
oct | 116566021121703 |
9 | 21135876612171 |
10 | 5410321114051 |
11 | 17a6560249687 |
12 | 734681716b17 |
13 | 303263aa1089 |
14 | 149c0a5ba147 |
15 | 95b052a7d01 |
hex | 4ebb044a3c3 |
5410321114051 has 8 divisors (see below), whose sum is σ = 6327020040704. Its totient is φ = 4529571165000.
The previous prime is 5410321114031. The next prime is 5410321114057. The reversal of 5410321114051 is 1504111230145.
It is a happy number.
5410321114051 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5410321114051 - 213 = 5410321105859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5410321114057) 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, 8987244075 + ... + 8987244676.
It is an arithmetic number, because the mean of its divisors is an integer number (790877505088).
Almost surely, 25410321114051 is an apocalyptic number.
5410321114051 is a deficient number, since it is larger than the sum of its proper divisors (916698926653).
5410321114051 is a wasteful number, since it uses less digits than its factorization.
5410321114051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17974488801.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 5410321114051 its reverse (1504111230145), we get a palindrome (6914432344196).
The spelling of 5410321114051 in words is "five trillion, four hundred ten billion, three hundred twenty-one million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •