Base | Representation |
---|---|
bin | 11000001100001011010… |
… | …100100000110000000000 |
3 | 12212220210111020221001110 |
4 | 120030023110200300000 |
5 | 204213434110114302 |
6 | 3311400340003320 |
7 | 231046251104100 |
oct | 30141324406000 |
9 | 5786714227043 |
10 | 1662342269952 |
11 | 590aa4968641 |
12 | 22a20b090540 |
13 | c09b1a08180 |
14 | 5a65a293200 |
15 | 2d3947a7b6c |
hex | 1830b520c00 |
1662342269952 has 1056 divisors, whose sum is σ = 5829394851840. Its totient is φ = 416922992640.
The previous prime is 1662342269879. The next prime is 1662342269957. The reversal of 1662342269952 is 2599622432661.
It is a junction number, because it is equal to n+sod(n) for n = 1662342269892 and 1662342269901.
It is not an unprimeable number, because it can be changed into a prime (1662342269957) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4064406324 + ... + 4064406732.
Almost surely, 21662342269952 is an apocalyptic number.
1662342269952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1662342269952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2914697425920).
1662342269952 is an abundant number, since it is smaller than the sum of its proper divisors (4167052581888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1662342269952 is a wasteful number, since it uses less digits than its factorization.
1662342269952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 557 (or 532 counting only the distinct ones).
The product of its digits is 16796160, while the sum is 57.
The spelling of 1662342269952 in words is "one trillion, six hundred sixty-two billion, three hundred forty-two million, two hundred sixty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •