Base | Representation |
---|---|
bin | 11110000001001001011001… |
… | …010000110011100001010010 |
3 | 122022110000012220002102121010 |
4 | 132001021121100303201102 |
5 | 114301004333243301002 |
6 | 1144441124344511350 |
7 | 36544100454131511 |
oct | 3601113120634122 |
9 | 568400186072533 |
10 | 132020202322002 |
11 | 3907a4a94a65a5 |
12 | 1298249677b556 |
13 | 58885b43b2337 |
14 | 2485b51b5c678 |
15 | 103e235e5946c |
hex | 781259433852 |
132020202322002 has 32 divisors (see below), whose sum is σ = 277939309636800. Its totient is φ = 41690283968448.
The previous prime is 132020202321991. The next prime is 132020202322033. The reversal of 132020202322002 is 200223202020231.
It is a super-2 number, since 2×1320202023220022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132020202322002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11592228 + ... + 19960464.
It is an arithmetic number, because the mean of its divisors is an integer number (8685603426150).
Almost surely, 2132020202322002 is an apocalyptic number.
132020202322002 is an abundant number, since it is smaller than the sum of its proper divisors (145919107314798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132020202322002 is a wasteful number, since it uses less digits than its factorization.
132020202322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8506650.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 132020202322002 its reverse (200223202020231), we get a palindrome (332243404342233).
The spelling of 132020202322002 in words is "one hundred thirty-two trillion, twenty billion, two hundred two million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •