Base | Representation |
---|---|
bin | 11101110010100111000001… |
… | …010011010100101000011010 |
3 | 122011220111200010102101000222 |
4 | 131302213001103110220122 |
5 | 114133122424412314120 |
6 | 1142354152344000042 |
7 | 36411653661152420 |
oct | 3562470123245032 |
9 | 564814603371028 |
10 | 131021220432410 |
11 | 38824873244070 |
12 | 12840959760022 |
13 | 581532c024cb9 |
14 | 244d664a19110 |
15 | 1023268ca0525 |
hex | 7729c14d4a1a |
131021220432410 has 128 divisors (see below), whose sum is σ = 295003533427200. Its totient is φ = 40703006776320.
The previous prime is 131021220432329. The next prime is 131021220432457. The reversal of 131021220432410 is 14234022120131.
It is a happy number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131021220432410.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 411095396 + ... + 411413984.
It is an arithmetic number, because the mean of its divisors is an integer number (2304715104900).
Almost surely, 2131021220432410 is an apocalyptic number.
131021220432410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131021220432410 is an abundant number, since it is smaller than the sum of its proper divisors (163982312994790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131021220432410 is a wasteful number, since it uses less digits than its factorization.
131021220432410 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320376.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 131021220432410 its reverse (14234022120131), we get a palindrome (145255242552541).
The spelling of 131021220432410 in words is "one hundred thirty-one trillion, twenty-one billion, two hundred twenty million, four hundred thirty-two thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •