Base | Representation |
---|---|
bin | 11111000010011000111… |
… | …11000100010101010000 |
3 | 10202221122200210021200120 |
4 | 33201030133010111100 |
5 | 114433024341231112 |
6 | 2133525153150240 |
7 | 140022153542106 |
oct | 17411437042520 |
9 | 3687580707616 |
10 | 1066435102032 |
11 | 3812aa8a43a3 |
12 | 152822b5b380 |
13 | 79744ca33c1 |
14 | 39889809c76 |
15 | 1cb18deae8c |
hex | f84c7c4550 |
1066435102032 has 80 divisors (see below), whose sum is σ = 2850246144000. Its totient is φ = 343185536512.
The previous prime is 1066435102001. The next prime is 1066435102037. The reversal of 1066435102032 is 2302015346601.
It is a super-2 number, since 2×10664351020322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1066435101984 and 1066435102002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066435102037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16001194 + ... + 16067702.
It is an arithmetic number, because the mean of its divisors is an integer number (35628076800).
Almost surely, 21066435102032 is an apocalyptic number.
1066435102032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1066435102032 is an abundant number, since it is smaller than the sum of its proper divisors (1783811041968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066435102032 is a wasteful number, since it uses less digits than its factorization.
1066435102032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78068 (or 78062 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
The spelling of 1066435102032 in words is "one trillion, sixty-six billion, four hundred thirty-five million, one hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •