Base | Representation |
---|---|
bin | 1100000001101000… |
… | …01011100010011011 |
3 | 121122221100100222111 |
4 | 12000310023202123 |
5 | 101210232122231 |
6 | 2544345133151 |
7 | 315663124354 |
oct | 60064134233 |
9 | 17587310874 |
10 | 6456129691 |
11 | 2813353880 |
12 | 130218a1b7 |
13 | 7bb7307ab |
14 | 453624d2b |
15 | 27bbd74b1 |
hex | 180d0b89b |
6456129691 has 4 divisors (see below), whose sum is σ = 7043050584. Its totient is φ = 5869208800.
The previous prime is 6456129679. The next prime is 6456129707. The reversal of 6456129691 is 1969216546.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6456129691 is a prime.
It is a super-2 number, since 2×64561296912 = 83363221174023510962, which contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6456129671) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 293460430 + ... + 293460451.
It is an arithmetic number, because the mean of its divisors is an integer number (1760762646).
Almost surely, 26456129691 is an apocalyptic number.
6456129691 is a deficient number, since it is larger than the sum of its proper divisors (586920893).
6456129691 is a wasteful number, since it uses less digits than its factorization.
6456129691 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 586920892.
The product of its digits is 699840, while the sum is 49.
The square root of 6456129691 is about 80350.0447479651. The cubic root of 6456129691 is about 1862.0474708341.
The spelling of 6456129691 in words is "six billion, four hundred fifty-six million, one hundred twenty-nine thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •