Base | Representation |
---|---|
bin | 1111011100101101010001… |
… | …0110010010010101100100 |
3 | 2020010211111000111111002220 |
4 | 3313023110112102111210 |
5 | 4211244022001103302 |
6 | 100043110424032340 |
7 | 3402121345553154 |
oct | 367132426222544 |
9 | 66124430444086 |
10 | 16985863300452 |
11 | 54597340157a2 |
12 | 1aa3b833026b0 |
13 | 9629b5a51c77 |
14 | 42a197a66764 |
15 | 1e6c9450a4bc |
hex | f72d4592564 |
16985863300452 has 48 divisors (see below), whose sum is σ = 39729977727552. Its totient is φ = 5648213450880.
The previous prime is 16985863300447. The next prime is 16985863300487. The reversal of 16985863300452 is 25400336858961.
16985863300452 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×169858633004522 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7690063 + ... + 9649289.
It is an arithmetic number, because the mean of its divisors is an integer number (827707869324).
Almost surely, 216985863300452 is an apocalyptic number.
16985863300452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16985863300452 is an abundant number, since it is smaller than the sum of its proper divisors (22744114427100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16985863300452 is a wasteful number, since it uses less digits than its factorization.
16985863300452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1960988 (or 1960986 counting only the distinct ones).
The product of its (nonzero) digits is 37324800, while the sum is 60.
The spelling of 16985863300452 in words is "sixteen trillion, nine hundred eighty-five billion, eight hundred sixty-three million, three hundred thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •