Base | Representation |
---|---|
bin | 100111010111010010100… |
… | …0000100101110100011101 |
3 | 201011012111102020122221100 |
4 | 1032232211000211310131 |
5 | 1202114422322034323 |
6 | 15301214101223313 |
7 | 1065604056056526 |
oct | 116564500456435 |
9 | 21135442218840 |
10 | 5410132221213 |
11 | 17a64736626a5 |
12 | 73462a401b39 |
13 | 303233905575 |
14 | 149bcd48984d |
15 | 95ae38e4943 |
hex | 4eba5025d1d |
5410132221213 has 12 divisors (see below), whose sum is σ = 7821945674140. Its totient is φ = 3603380855616.
The previous prime is 5410132221191. The next prime is 5410132221217. The reversal of 5410132221213 is 3121222310145.
It is a happy number.
5410132221213 is a `hidden beast` number, since 5 + 4 + 101 + 322 + 21 + 213 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1455550557444 + 3954581663769 = 1206462^2 + 1988613^2 .
It is not a de Polignac number, because 5410132221213 - 213 = 5410132213021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5410132221217) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 281153056 + ... + 281172297.
Almost surely, 25410132221213 is an apocalyptic number.
It is an amenable number.
5410132221213 is a deficient number, since it is larger than the sum of its proper divisors (2411813452927).
5410132221213 is a wasteful number, since it uses less digits than its factorization.
5410132221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562326428 (or 562326425 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 5410132221213 its reverse (3121222310145), we get a palindrome (8531354531358).
The spelling of 5410132221213 in words is "five trillion, four hundred ten billion, one hundred thirty-two million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •