Base | Representation |
---|---|
bin | 111101100010010000… |
… | …1111000111101110100 |
3 | 110122002111110101201012 |
4 | 1323010201320331310 |
5 | 4131113414043200 |
6 | 140412424251352 |
7 | 12355464324650 |
oct | 1730441707564 |
9 | 418074411635 |
10 | 132146237300 |
11 | 51052118a70 |
12 | 2173b610b58 |
13 | c5cc73122c |
14 | 657854da60 |
15 | 36864b0a35 |
hex | 1ec4878f74 |
132146237300 has 144 divisors (see below), whose sum is σ = 362853109248. Its totient is φ = 40573526400.
The previous prime is 132146237269. The next prime is 132146237341. The reversal of 132146237300 is 3732641231.
It is a super-2 number, since 2×1321462373002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 387827 + ... + 643973.
Almost surely, 2132146237300 is an apocalyptic number.
132146237300 is a gapful number since it is divisible by the number (10) 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 132146237300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181426554624).
132146237300 is an abundant number, since it is smaller than the sum of its proper divisors (230706871948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132146237300 is a wasteful number, since it uses less digits than its factorization.
132146237300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256246 (or 256239 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 132146237300 its reverse (3732641231), we get a palindrome (135878878531).
The spelling of 132146237300 in words is "one hundred thirty-two billion, one hundred forty-six million, two hundred thirty-seven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •