Base | Representation |
---|---|
bin | 111101101000110000… |
… | …1000001100101111100 |
3 | 110122122200102200202201 |
4 | 1323101201001211330 |
5 | 4132040203124200 |
6 | 140450210201244 |
7 | 12364051256605 |
oct | 1732141014574 |
9 | 418580380681 |
10 | 132364114300 |
11 | 51154101200 |
12 | 217a0583224 |
13 | c635907532 |
14 | 6599466dac |
15 | 369a69bc6a |
hex | 1ed184197c |
132364114300 has 108 divisors (see below), whose sum is σ = 320164539408. Its totient is φ = 47454176000.
The previous prime is 132364114249. The next prime is 132364114343. The reversal of 132364114300 is 3411463231.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 782064 + ... + 936136.
It is an arithmetic number, because the mean of its divisors is an integer number (2964486476).
Almost surely, 2132364114300 is an apocalyptic number.
132364114300 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 132364114300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160082269704).
132364114300 is an abundant number, since it is smaller than the sum of its proper divisors (187800425108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132364114300 is a wasteful number, since it uses less digits than its factorization.
132364114300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154180 (or 154162 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 132364114300 its reverse (3411463231), we get a palindrome (135775577531).
The spelling of 132364114300 in words is "one hundred thirty-two billion, three hundred sixty-four million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •