Base | Representation |
---|---|
bin | 11101110100000101110110… |
… | …011110111110100000100110 |
3 | 122012021020111102012110010012 |
4 | 131310011312132332200212 |
5 | 114141304443332131210 |
6 | 1142513032305130222 |
7 | 36422220163536131 |
oct | 3564056636764046 |
9 | 565236442173105 |
10 | 131123044411430 |
11 | 38863a75221645 |
12 | 12858636329972 |
13 | 5821b0869c066 |
14 | 2454563dd5218 |
15 | 1025c281cd305 |
hex | 7741767be826 |
131123044411430 has 8 divisors (see below), whose sum is σ = 236021479940592. Its totient is φ = 52449217764568.
The previous prime is 131123044411417. The next prime is 131123044411441. The reversal of 131123044411430 is 34114440321131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1311230444114302 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6556152220562 + ... + 6556152220581.
It is an arithmetic number, because the mean of its divisors is an integer number (29502684992574).
Almost surely, 2131123044411430 is an apocalyptic number.
131123044411430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131123044411430 is a deficient number, since it is larger than the sum of its proper divisors (104898435529162).
131123044411430 is a wasteful number, since it uses less digits than its factorization.
131123044411430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13112304441150.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 131123044411430 its reverse (34114440321131), we get a palindrome (165237484732561).
The spelling of 131123044411430 in words is "one hundred thirty-one trillion, one hundred twenty-three billion, forty-four million, four hundred eleven thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •