Base | Representation |
---|---|
bin | 11101111001000000100… |
… | …10000110111100100000 |
3 | 10122011222002200212102220 |
4 | 32330200102012330200 |
5 | 113311333413123241 |
6 | 2103452021511040 |
7 | 134125656526455 |
oct | 16744022067440 |
9 | 3564862625386 |
10 | 1027038801696 |
11 | 3666236a08a6 |
12 | 147069272480 |
13 | 75b0701369b |
14 | 379cd4a982c |
15 | 1bab0413166 |
hex | ef20486f20 |
1027038801696 has 24 divisors (see below), whose sum is σ = 2695976854704. Its totient is φ = 342346267200.
The previous prime is 1027038801673. The next prime is 1027038801731. The reversal of 1027038801696 is 6961088307201.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×10270388016962 (a number of 25 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 5349160330 + ... + 5349160521.
It is an arithmetic number, because the mean of its divisors is an integer number (112332368946).
Almost surely, 21027038801696 is an apocalyptic number.
1027038801696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1027038801696 is an abundant number, since it is smaller than the sum of its proper divisors (1668938053008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1027038801696 is a wasteful number, since it uses less digits than its factorization.
1027038801696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10698320864 (or 10698320856 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 51.
The spelling of 1027038801696 in words is "one trillion, twenty-seven billion, thirty-eight million, eight hundred one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.784 sec. • engine limits •