Base | Representation |
---|---|
bin | 11110000101100000101100… |
… | …100100000100111110010110 |
3 | 122100111200022021200120011001 |
4 | 132011200230210010332112 |
5 | 114320413031112011410 |
6 | 1145231003111133514 |
7 | 36604545301230514 |
oct | 3605405444047626 |
9 | 570450267616131 |
10 | 132320100110230 |
11 | 39185703a3065a |
12 | 12a1063197429a |
13 | 58aa968ca47b6 |
14 | 24964814954b4 |
15 | 1046e3967833a |
hex | 78582c904f96 |
132320100110230 has 32 divisors (see below), whose sum is σ = 241254998454240. Its totient is φ = 52248174816000.
The previous prime is 132320100110213. The next prime is 132320100110273. The reversal of 132320100110230 is 32011001023231.
It is a junction number, because it is equal to n+sod(n) for n = 132320100110198 and 132320100110207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 269542521 + ... + 270032980.
It is an arithmetic number, because the mean of its divisors is an integer number (7539218701695).
Almost surely, 2132320100110230 is an apocalyptic number.
132320100110230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132320100110230 is a deficient number, since it is larger than the sum of its proper divisors (108934898344010).
132320100110230 is a wasteful number, since it uses less digits than its factorization.
132320100110230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539575824.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132320100110230 its reverse (32011001023231), we get a palindrome (164331101133461).
The spelling of 132320100110230 in words is "one hundred thirty-two trillion, three hundred twenty billion, one hundred million, one hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •