Base | Representation |
---|---|
bin | 11110000000110110110111… |
… | …000111100100010000010010 |
3 | 122022101002212000100112012200 |
4 | 132000312313013210100102 |
5 | 114300143104320401002 |
6 | 1144424033542304030 |
7 | 36542464353204636 |
oct | 3600666707442022 |
9 | 568332760315180 |
10 | 132000302122002 |
11 | 39072017341816 |
12 | 1297a662128016 |
13 | 58867625ab172 |
14 | 2484bc4c14dc6 |
15 | 103d96dd53b1c |
hex | 780db71e4412 |
132000302122002 has 12 divisors (see below), whose sum is σ = 286000654597710. Its totient is φ = 44000100707328.
The previous prime is 132000302121973. The next prime is 132000302122019. The reversal of 132000302122002 is 200221203000231.
It can be written as a sum of positive squares in only one way, i.e., 125421431087241 + 6578871034761 = 11199171^2 + 2564931^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 7333350117889 = 132000302122002 / (1 + 3 + 2 + 0 + 0 + 0 + 3 + 0 + 2 + 1 + 2 + 2 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3666675058927 + ... + 3666675058962.
Almost surely, 2132000302122002 is an apocalyptic number.
132000302122002 is an abundant number, since it is smaller than the sum of its proper divisors (154000352475708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132000302122002 is a wasteful number, since it uses less digits than its factorization.
132000302122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7333350117897 (or 7333350117894 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 132000302122002 its reverse (200221203000231), we get a palindrome (332221505122233).
The spelling of 132000302122002 in words is "one hundred thirty-two trillion, three hundred two million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •