Base | Representation |
---|---|
bin | 11110000001110100001111… |
… | …101000110011110000011100 |
3 | 122022121101222100221001210111 |
4 | 132001310033220303300130 |
5 | 114302233100201200300 |
6 | 1144514214034215404 |
7 | 36550316561546446 |
oct | 3601641750636034 |
9 | 568541870831714 |
10 | 132066211740700 |
11 | 39097a69628876 |
12 | 1298b397124564 |
13 | 588ca3747a743 |
14 | 24880784ab496 |
15 | 104052a2d99ba |
hex | 781d0fa33c1c |
132066211740700 has 36 divisors (see below), whose sum is σ = 286816864186440. Its totient is φ = 52783501339840.
The previous prime is 132066211740679. The next prime is 132066211740703. The reversal of 132066211740700 is 7047112660231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132066211740703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 537168442 + ... + 537414241.
It is an arithmetic number, because the mean of its divisors is an integer number (7967135116290).
Almost surely, 2132066211740700 is an apocalyptic number.
132066211740700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132066211740700 is an abundant number, since it is smaller than the sum of its proper divisors (154750652445740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132066211740700 is a wasteful number, since it uses less digits than its factorization.
132066211740700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074583926 (or 1074583919 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 40.
The spelling of 132066211740700 in words is "one hundred thirty-two trillion, sixty-six billion, two hundred eleven million, seven hundred forty thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •