Base | Representation |
---|---|
bin | 1111100000100011111001… |
… | …0010001001111111010100 |
3 | 2020101011100201212221221212 |
4 | 3320020332102021333110 |
5 | 4213340112132041040 |
6 | 100133335514400552 |
7 | 3406654032640151 |
oct | 370107622117724 |
9 | 66334321787855 |
10 | 17052065112020 |
11 | 5484816233664 |
12 | 1ab497a130158 |
13 | 969006317933 |
14 | 42d47805d228 |
15 | 1e886b45bd65 |
hex | f823e489fd4 |
17052065112020 has 12 divisors (see below), whose sum is σ = 35809336735284. Its totient is φ = 6820826044800.
The previous prime is 17052065112011. The next prime is 17052065112041. The reversal of 17052065112020 is 2021156025071.
It can be written as a sum of positive squares in 2 ways, for example, as 6361270888336 + 10690794223684 = 2522156^2 + 3269678^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 426301627781 + ... + 426301627820.
It is an arithmetic number, because the mean of its divisors is an integer number (2984111394607).
Almost surely, 217052065112020 is an apocalyptic number.
17052065112020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
17052065112020 is an abundant number, since it is smaller than the sum of its proper divisors (18757271623264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17052065112020 is a wasteful number, since it uses less digits than its factorization.
17052065112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852603255610 (or 852603255608 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 32.
The spelling of 17052065112020 in words is "seventeen trillion, fifty-two billion, sixty-five million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •