Base | Representation |
---|---|
bin | 100111011000111010010… |
… | …1100101001100100111011 |
3 | 201011112111020211020000122 |
4 | 1032301310230221210323 |
5 | 1202144041330422101 |
6 | 15302551532523455 |
7 | 1066056316213562 |
oct | 116616454514473 |
9 | 21145436736018 |
10 | 5413616654651 |
11 | 17a79a1518057 |
12 | 73524132058b |
13 | 30366a7816ba |
14 | 14a040154bd9 |
15 | 95c4977951b |
hex | 4ec74b2993b |
5413616654651 has 8 divisors (see below), whose sum is σ = 5448674904864. Its totient is φ = 5378565703680.
The previous prime is 5413616654617. The next prime is 5413616654681. The reversal of 5413616654651 is 1564566163145.
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 5413616654651 - 214 = 5413616638267 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5413616654593 and 5413616654602.
It is not an unprimeable number, because it can be changed into a prime (5413616654681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 332735 + ... + 3307256.
It is an arithmetic number, because the mean of its divisors is an integer number (681084363108).
Almost surely, 25413616654651 is an apocalyptic number.
5413616654651 is a deficient number, since it is larger than the sum of its proper divisors (35058250213).
5413616654651 is a wasteful number, since it uses less digits than its factorization.
5413616654651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3649621.
The product of its digits is 7776000, while the sum is 53.
The spelling of 5413616654651 in words is "five trillion, four hundred thirteen billion, six hundred sixteen million, six hundred fifty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •