Base | Representation |
---|---|
bin | 11110000101010000110001… |
… | …111010011111000101010000 |
3 | 122100110001012020122001221010 |
4 | 132011100301322133011100 |
5 | 114320123031030014412 |
6 | 1145215055210530520 |
7 | 36603401631551040 |
oct | 3605206172370520 |
9 | 570401166561833 |
10 | 132303010001232 |
11 | 39179434016834 |
12 | 12a09262436a40 |
13 | 58a9174421975 |
14 | 24956dd83b720 |
15 | 104678910233c |
hex | 785431e9f150 |
132303010001232 has 80 divisors (see below), whose sum is σ = 390683563794432. Its totient is φ = 37793633182080.
The previous prime is 132303010001209. The next prime is 132303010001243. The reversal of 132303010001232 is 232100010303231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 132303010001199 and 132303010001208.
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, 35879448 + ... + 39394679.
Almost surely, 2132303010001232 is an apocalyptic number.
132303010001232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132303010001232 is an abundant number, since it is smaller than the sum of its proper divisors (258380553793200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132303010001232 is a wasteful number, since it uses less digits than its factorization.
132303010001232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75279376 (or 75279370 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 132303010001232 its reverse (232100010303231), we get a palindrome (364403020304463).
The spelling of 132303010001232 in words is "one hundred thirty-two trillion, three hundred three billion, ten million, one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •