Base | Representation |
---|---|
bin | 10111001100100101110101… |
… | …000111100111100010101100 |
3 | 111101020001021201200111101120 |
4 | 113030211311013213202230 |
5 | 101333000110204110012 |
6 | 1000551253414340540 |
7 | 30326503466230104 |
oct | 2714456507474254 |
9 | 441201251614346 |
10 | 102020323113132 |
11 | 2a563637807726 |
12 | b53827b95a750 |
13 | 44c0623cb6138 |
14 | 1b29b4a856204 |
15 | bbdbb1a9058c |
hex | 5cc9751e78ac |
102020323113132 has 24 divisors (see below), whose sum is σ = 238317622007472. Its totient is φ = 33968174169600.
The previous prime is 102020323113101. The next prime is 102020323113139. The reversal of 102020323113132 is 231311323020201.
It is not an unprimeable number, because it can be changed into a prime (102020323113139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4825014169 + ... + 4825035312.
It is an arithmetic number, because the mean of its divisors is an integer number (9929900916978).
Almost surely, 2102020323113132 is an apocalyptic number.
102020323113132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102020323113132 is an abundant number, since it is smaller than the sum of its proper divisors (136297298894340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020323113132 is a wasteful number, since it uses less digits than its factorization.
102020323113132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9650050369 (or 9650050367 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 102020323113132 its reverse (231311323020201), we get a palindrome (333331646133333).
The spelling of 102020323113132 in words is "one hundred two trillion, twenty billion, three hundred twenty-three million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •