Base | Representation |
---|---|
bin | 11110101011011011101… |
… | …01100000001000000000 |
3 | 10201202211201102110211110 |
4 | 33111231311200020000 |
5 | 114232304042314110 |
6 | 2124130141443320 |
7 | 136104551601546 |
oct | 17255565401000 |
9 | 3652751373743 |
10 | 1054109729280 |
11 | 377055509423 |
12 | 150363270540 |
13 | 7852c5c902a |
14 | 3903a8d1d96 |
15 | 1c646d08a20 |
hex | f56dd60200 |
1054109729280 has 80 divisors (see below), whose sum is σ = 3369857065344. Its totient is φ = 281095925760.
The previous prime is 1054109729273. The next prime is 1054109729297. The reversal of 1054109729280 is 829279014501.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×10541097292802 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68619256 + ... + 68634615.
Almost surely, 21054109729280 is an apocalyptic number.
1054109729280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1054109729280 is an abundant number, since it is smaller than the sum of its proper divisors (2315747336064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054109729280 is an equidigital number, since it uses as much as digits as its factorization.
1054109729280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137253897 (or 137253881 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 48.
The spelling of 1054109729280 in words is "one trillion, fifty-four billion, one hundred nine million, seven hundred twenty-nine thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •