Base | Representation |
---|---|
bin | 11110000001000101000010… |
… | …111001000001111000000100 |
3 | 122022102120011102002200012010 |
4 | 132001011002321001320010 |
5 | 114300420302144221200 |
6 | 1144435033112054220 |
7 | 36543543644216352 |
oct | 3601050271017004 |
9 | 568376142080163 |
10 | 132015532023300 |
11 | 3907852220a002 |
12 | 129815b2694370 |
13 | 588801b950593 |
14 | 248582b7a27d2 |
15 | 103e060e2c150 |
hex | 781142e41e04 |
132015532023300 has 36 divisors (see below), whose sum is σ = 381964939321616. Its totient is φ = 35204141872800.
The previous prime is 132015532023283. The next prime is 132015532023451. The reversal of 132015532023300 is 3320235510231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 220025886406 + ... + 220025887005.
Almost surely, 2132015532023300 is an apocalyptic number.
132015532023300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132015532023300 is an abundant number, since it is smaller than the sum of its proper divisors (249949407298316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132015532023300 is a wasteful number, since it uses less digits than its factorization.
132015532023300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440051773428 (or 440051773421 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 132015532023300 its reverse (3320235510231), we get a palindrome (135335767533531).
The spelling of 132015532023300 in words is "one hundred thirty-two trillion, fifteen billion, five hundred thirty-two million, twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •