Base | Representation |
---|---|
bin | 10100000010111011111… |
… | …100001011111000100000 |
3 | 11212200200022112021200220 |
4 | 110002323330023320200 |
5 | 140032201404321144 |
6 | 2532500115443040 |
7 | 201344535224412 |
oct | 24027374137040 |
9 | 4780608467626 |
10 | 1377542651424 |
11 | 491237a06985 |
12 | 1a2b882b6480 |
13 | 9cb950b4434 |
14 | 4a95dc169b2 |
15 | 25c767e0919 |
hex | 140bbf0be20 |
1377542651424 has 48 divisors (see below), whose sum is σ = 3828758256288. Its totient is φ = 432170243072.
The previous prime is 1377542651389. The next prime is 1377542651449. The reversal of 1377542651424 is 4241562457731.
It is a tau number, because it is divible by the number of its divisors (48).
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 422039622 + ... + 422042885.
It is an arithmetic number, because the mean of its divisors is an integer number (79765797006).
Almost surely, 21377542651424 is an apocalyptic number.
It is an amenable number.
1377542651424 is an abundant number, since it is smaller than the sum of its proper divisors (2451215604864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1377542651424 is a wasteful number, since it uses less digits than its factorization.
1377542651424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844082537 (or 844082529 counting only the distinct ones).
The product of its digits is 5644800, while the sum is 51.
The spelling of 1377542651424 in words is "one trillion, three hundred seventy-seven billion, five hundred forty-two million, six hundred fifty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •