Base | Representation |
---|---|
bin | 1001001001111001010101… |
… | …11100110011110001100100 |
3 | 2122021112020012012002021012 |
4 | 10210330222330303301210 |
5 | 10114312230432101012 |
6 | 110452054353441352 |
7 | 4145301463122662 |
oct | 444745274636144 |
9 | 78245205162235 |
10 | 20131232300132 |
11 | 64616758a4528 |
12 | 2311698b70258 |
13 | b304a057b935 |
14 | 4d84dd263c32 |
15 | 24d9d5eb5622 |
hex | 124f2af33c64 |
20131232300132 has 6 divisors (see below), whose sum is σ = 35229656525238. Its totient is φ = 10065616150064.
The previous prime is 20131232299933. The next prime is 20131232300159. The reversal of 20131232300132 is 23100323213102.
It can be written as a sum of positive squares in only one way, i.e., 15125067697216 + 5006164602916 = 3889096^2 + 2237446^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20131232300098 and 20131232300107.
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 as a sum of consecutive naturals, namely, 2516404037513 + ... + 2516404037520.
It is an arithmetic number, because the mean of its divisors is an integer number (5871609420873).
Almost surely, 220131232300132 is an apocalyptic number.
It is an amenable number.
20131232300132 is a deficient number, since it is larger than the sum of its proper divisors (15098424225106).
20131232300132 is a wasteful number, since it uses less digits than its factorization.
20131232300132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5032808075037 (or 5032808075035 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20131232300132 its reverse (23100323213102), we get a palindrome (43231555513234).
The spelling of 20131232300132 in words is "twenty trillion, one hundred thirty-one billion, two hundred thirty-two million, three hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •