Base | Representation |
---|---|
bin | 1001001001111011001001… |
… | …10000000010010000110100 |
3 | 2122021121201202220110202010 |
4 | 10210331210300002100310 |
5 | 10114321222204431012 |
6 | 110452334514244220 |
7 | 4145334506522103 |
oct | 444754460022064 |
9 | 78247652813663 |
10 | 20132202030132 |
11 | 6462023222a85 |
12 | 2311909886670 |
13 | b305c644ac7a |
14 | 4d8591d7203a |
15 | 24da411b7c3c |
hex | 124f64c02434 |
20132202030132 has 24 divisors (see below), whose sum is σ = 48594970418400. Its totient is φ = 6479329388896.
The previous prime is 20132202030121. The next prime is 20132202030211. The reversal of 20132202030132 is 23103020223102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 20132202030099 and 20132202030108.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 28925577282 + ... + 28925577977.
It is an arithmetic number, because the mean of its divisors is an integer number (2024790434100).
Almost surely, 220132202030132 is an apocalyptic number.
It is an amenable number.
20132202030132 is an abundant number, since it is smaller than the sum of its proper divisors (28462768388268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132202030132 is a wasteful number, since it uses less digits than its factorization.
20132202030132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57851155295 (or 57851155293 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 20132202030132 its reverse (23103020223102), we get a palindrome (43235222253234).
The spelling of 20132202030132 in words is "twenty trillion, one hundred thirty-two billion, two hundred two million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •