Base | Representation |
---|---|
bin | 1001001110111001111000… |
… | …01011101101010000110100 |
3 | 2122212222102021202121021210 |
4 | 10213130330023231100310 |
5 | 10130122144422011012 |
6 | 111103114432441420 |
7 | 4163603125304523 |
oct | 447347413552064 |
9 | 78788367677253 |
10 | 20303320110132 |
11 | 6518653994204 |
12 | 233ab049a9270 |
13 | b43796c16247 |
14 | 5029862d24ba |
15 | 253208c6b23c |
hex | 12773c2ed434 |
20303320110132 has 12 divisors (see below), whose sum is σ = 47374413590336. Its totient is φ = 6767773370040.
The previous prime is 20303320110113. The next prime is 20303320110221. The reversal of 20303320110132 is 23101102330302.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 20303320110099 and 20303320110108.
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 3 ways as a sum of consecutive naturals, for example, 845971671244 + ... + 845971671267.
Almost surely, 220303320110132 is an apocalyptic number.
It is an amenable number.
20303320110132 is an abundant number, since it is smaller than the sum of its proper divisors (27071093480204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20303320110132 is a wasteful number, since it uses less digits than its factorization.
20303320110132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691943342518 (or 1691943342516 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20303320110132 its reverse (23101102330302), we get a palindrome (43404422440434).
The spelling of 20303320110132 in words is "twenty trillion, three hundred three billion, three hundred twenty million, one hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •