Base | Representation |
---|---|
bin | 1001101100101011010100… |
… | …0110011110110110100000 |
3 | 1101202101110001200122022221 |
4 | 2123022311012132312200 |
5 | 2344201111141012000 |
6 | 34402325431040424 |
7 | 2150246504516014 |
oct | 233126506366640 |
9 | 41671401618287 |
10 | 10663147204000 |
11 | 3441240677615 |
12 | 124270a510114 |
13 | 5c46b85877a5 |
14 | 28c155c2a544 |
15 | 13758d98361a |
hex | 9b2b519eda0 |
10663147204000 has 96 divisors (see below), whose sum is σ = 26200729573200. Its totient is φ = 4265034726400.
The previous prime is 10663147203983. The next prime is 10663147204033. The reversal of 10663147204000 is 40274136601.
10663147204000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 328645372176 + 10334501831824 = 573276^2 + 3214732^2 .
It is a super-2 number, since 2×106631472040002 (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, 90777306 + ... + 90894694.
Almost surely, 210663147204000 is an apocalyptic number.
10663147204000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10663147204000 is an abundant number, since it is smaller than the sum of its proper divisors (15537582369200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10663147204000 is a wasteful number, since it uses less digits than its factorization.
10663147204000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140123 (or 140105 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 34.
The spelling of 10663147204000 in words is "ten trillion, six hundred sixty-three billion, one hundred forty-seven million, two hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •