Base | Representation |
---|---|
bin | 11110000000111001100101… |
… | …101001101100001100110110 |
3 | 122022101101102002020112102212 |
4 | 132000321211221230030312 |
5 | 114300220103424144110 |
6 | 1144425240303333422 |
7 | 36542630050266602 |
oct | 3600714551541466 |
9 | 568341362215385 |
10 | 132003230303030 |
11 | 3907328a209539 |
12 | 1297b13a8b1272 |
13 | 5886b0b137c68 |
14 | 2484dc1a84502 |
15 | 103da90e5ce05 |
hex | 780e65a6c336 |
132003230303030 has 32 divisors (see below), whose sum is σ = 237740394124800. Its totient is φ = 52771389102432.
The previous prime is 132003230303029. The next prime is 132003230303083. The reversal of 132003230303030 is 30303032300231.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132003230302987 and 132003230303005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309029741 + ... + 309456599.
It is an arithmetic number, because the mean of its divisors is an integer number (7429387316400).
Almost surely, 2132003230303030 is an apocalyptic number.
132003230303030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132003230303030 is a deficient number, since it is larger than the sum of its proper divisors (105737163821770).
132003230303030 is a wasteful number, since it uses less digits than its factorization.
132003230303030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444308.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 132003230303030 its reverse (30303032300231), we get a palindrome (162306262603261).
The spelling of 132003230303030 in words is "one hundred thirty-two trillion, three billion, two hundred thirty million, three hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •