Base | Representation |
---|---|
bin | 1001001111011111000110… |
… | …01000111010011111010100 |
3 | 2122221212222210102010011022 |
4 | 10213233203020322133110 |
5 | 10130434110031322012 |
6 | 111120221241300312 |
7 | 4165211226363554 |
oct | 447574310723724 |
9 | 78855883363138 |
10 | 20323301042132 |
11 | 652607767a150 |
12 | 2342960494698 |
13 | b4562c675a2a |
14 | 50391dc53164 |
15 | 2539c7ebc472 |
hex | 127be323a7d4 |
20323301042132 has 48 divisors (see below), whose sum is σ = 41308294023360. Its totient is φ = 8646424588800.
The previous prime is 20323301042131. The next prime is 20323301042197. The reversal of 20323301042132 is 23124010332302.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20323301042131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74920382 + ... + 75191157.
It is an arithmetic number, because the mean of its divisors is an integer number (860589458820).
Almost surely, 220323301042132 is an apocalyptic number.
20323301042132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20323301042132 is an abundant number, since it is smaller than the sum of its proper divisors (20984992981228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20323301042132 is a wasteful number, since it uses less digits than its factorization.
20323301042132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150111752 (or 150111750 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 20323301042132 its reverse (23124010332302), we get a palindrome (43447311374434).
The spelling of 20323301042132 in words is "twenty trillion, three hundred twenty-three billion, three hundred one million, forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •