Base | Representation |
---|---|
bin | 101111000011111111110… |
… | …1111100101101101110111 |
3 | 211220100121010101102101020 |
4 | 1132013333233211231313 |
5 | 1321433401402231230 |
6 | 21431242502232223 |
7 | 1235212301431335 |
oct | 136077757455567 |
9 | 24810533342336 |
10 | 6468216445815 |
11 | 20741786151a3 |
12 | 885700725673 |
13 | 37bc47763177 |
14 | 1850c5b72b55 |
15 | b33be5d6810 |
hex | 5e1ffbe5b77 |
6468216445815 has 8 divisors (see below), whose sum is σ = 10349146313328. Its totient is φ = 3449715437760.
The previous prime is 6468216445811. The next prime is 6468216445819. The reversal of 6468216445815 is 5185446128646.
It is an interprime number because it is at equal distance from previous prime (6468216445811) and next prime (6468216445819).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6468216445815 - 22 = 6468216445811 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6468216445811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215607214846 + ... + 215607214875.
It is an arithmetic number, because the mean of its divisors is an integer number (1293643289166).
Almost surely, 26468216445815 is an apocalyptic number.
6468216445815 is a deficient number, since it is larger than the sum of its proper divisors (3880929867513).
6468216445815 is a wasteful number, since it uses less digits than its factorization.
6468216445815 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431214429729.
The product of its digits is 44236800, while the sum is 60.
The spelling of 6468216445815 in words is "six trillion, four hundred sixty-eight billion, two hundred sixteen million, four hundred forty-five thousand, eight hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •