Base | Representation |
---|---|
bin | 101110100100011110000… |
… | …1010011111101001001011 |
3 | 211122212211120222212221002 |
4 | 1131020330022133221023 |
5 | 1314331221211430201 |
6 | 21340204244205215 |
7 | 1230264422624342 |
oct | 135107412375113 |
9 | 24585746885832 |
10 | 6400510655051 |
11 | 2048494449517 |
12 | 87456609980b |
13 | 375747713c96 |
14 | 181b01b1cb59 |
15 | b175a60176b |
hex | 5d23c29fa4b |
6400510655051 has 16 divisors (see below), whose sum is σ = 6469230952800. Its totient is φ = 6331976236800.
The previous prime is 6400510655029. The next prime is 6400510655053. The reversal of 6400510655051 is 1505560150046.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 6400510655051 - 26 = 6400510654987 is a prime.
It is a super-2 number, since 2×64005106550512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6400510654996 and 6400510655014.
It is not an unprimeable number, because it can be changed into a prime (6400510655053) 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 15 ways as a sum of consecutive naturals, for example, 578231945 + ... + 578243013.
It is an arithmetic number, because the mean of its divisors is an integer number (404326934550).
Almost surely, 26400510655051 is an apocalyptic number.
6400510655051 is a deficient number, since it is larger than the sum of its proper divisors (68720297749).
6400510655051 is a wasteful number, since it uses less digits than its factorization.
6400510655051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18910.
The product of its (nonzero) digits is 90000, while the sum is 38.
The spelling of 6400510655051 in words is "six trillion, four hundred billion, five hundred ten million, six hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •