Base | Representation |
---|---|
bin | 101110111000110010100… |
… | …0010101001001001011110 |
3 | 211211001110121211222021000 |
4 | 1131301211002221021132 |
5 | 1321040102402320041 |
6 | 21412222212051130 |
7 | 1233400643243052 |
oct | 135614502511136 |
9 | 24731417758230 |
10 | 6444146135646 |
11 | 2064a4654997a |
12 | 880b03603aa6 |
13 | 3798aca1a09b |
14 | 183c81073c62 |
15 | b2961357bb6 |
hex | 5dc650a925e |
6444146135646 has 32 divisors (see below), whose sum is σ = 14362818331680. Its totient is φ = 2141674674048.
The previous prime is 6444146135599. The next prime is 6444146135671. The reversal of 6444146135646 is 6465316414446.
6444146135646 is a `hidden beast` number, since 6 + 4 + 4 + 4 + 14 + 61 + 3 + 564 + 6 = 666.
It is a super-2 number, since 2×64441461356462 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 6444146135592 and 6444146135601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177038241 + ... + 177074636.
It is an arithmetic number, because the mean of its divisors is an integer number (448838072865).
Almost surely, 26444146135646 is an apocalyptic number.
6444146135646 is an abundant number, since it is smaller than the sum of its proper divisors (7918672196034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6444146135646 is a wasteful number, since it uses less digits than its factorization.
6444146135646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354113225 (or 354113219 counting only the distinct ones).
The product of its digits is 19906560, while the sum is 54.
The spelling of 6444146135646 in words is "six trillion, four hundred forty-four billion, one hundred forty-six million, one hundred thirty-five thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •