Base | Representation |
---|---|
bin | 11110101011110110111… |
… | …11000100101010100000 |
3 | 10201210102200022221122220 |
4 | 33111323133010222200 |
5 | 114233241203340111 |
6 | 2124205002031040 |
7 | 136113332225211 |
oct | 17257337045240 |
9 | 3653380287586 |
10 | 1054338730656 |
11 | 3771627aa562 |
12 | 150407aa8480 |
13 | 78567b988c3 |
14 | 3905d0a3408 |
15 | 1c65be90e06 |
hex | f57b7c4aa0 |
1054338730656 has 48 divisors (see below), whose sum is σ = 2778162577344. Its totient is φ = 350109937664.
The previous prime is 1054338730639. The next prime is 1054338730681. The reversal of 1054338730656 is 6560378334501.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×10543387306562 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1054338730599 and 1054338730608.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20854401 + ... + 20904896.
It is an arithmetic number, because the mean of its divisors is an integer number (57878387028).
Almost surely, 21054338730656 is an apocalyptic number.
1054338730656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1054338730656 is an abundant number, since it is smaller than the sum of its proper divisors (1723823846688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054338730656 is a wasteful number, since it uses less digits than its factorization.
1054338730656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41759573 (or 41759565 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 51.
The spelling of 1054338730656 in words is "one trillion, fifty-four billion, three hundred thirty-eight million, seven hundred thirty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.077 sec. • engine limits •