Base | Representation |
---|---|
bin | 1001100101000101011000… |
… | …1001001110000100100100 |
3 | 1101021220202022210112011210 |
4 | 2121101112021032010210 |
5 | 2340031434444123200 |
6 | 34222354035231420 |
7 | 2134651151612253 |
oct | 231212611160444 |
9 | 41256668715153 |
10 | 10532705067300 |
11 | 33a0993472659 |
12 | 1221385748570 |
13 | 5b52cac0a410 |
14 | 285addb4c79a |
15 | 133ea6dd6650 |
hex | 9945624e124 |
10532705067300 has 72 divisors (see below), whose sum is σ = 32818828724416. Its totient is φ = 2592665861760.
The previous prime is 10532705067257. The next prime is 10532705067329. The reversal of 10532705067300 is 376050723501.
It is a super-2 number, since 2×105327050673002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1350342904 + ... + 1350350703.
Almost surely, 210532705067300 is an apocalyptic number.
10532705067300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10532705067300 is an abundant number, since it is smaller than the sum of its proper divisors (22286123657116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10532705067300 is a wasteful number, since it uses less digits than its factorization.
10532705067300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700693637 (or 2700693630 counting only the distinct ones).
The product of its (nonzero) digits is 132300, while the sum is 39.
The spelling of 10532705067300 in words is "ten trillion, five hundred thirty-two billion, seven hundred five million, sixty-seven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •