Base | Representation |
---|---|
bin | 11101110101101011101000… |
… | …000000111001001000110110 |
3 | 122012122200120020201200110212 |
4 | 131311223220000321020312 |
5 | 114200102244231411014 |
6 | 1143035144055145422 |
7 | 36433136211051344 |
oct | 3565535000711066 |
9 | 565580506650425 |
10 | 131232323310134 |
11 | 388a635231a672 |
12 | 12875853675272 |
13 | 582c20267c0b7 |
14 | 245996d50a994 |
15 | 10289c1d3623e |
hex | 775ae8039236 |
131232323310134 has 8 divisors (see below), whose sum is σ = 196848846186888. Its totient is φ = 65616041247840.
The previous prime is 131232323310061. The next prime is 131232323310167. The reversal of 131232323310134 is 431013323232131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
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 131232323310134.
It is a congruent number.
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 in 3 ways as a sum of consecutive naturals, for example, 58835012 + ... + 61024775.
It is an arithmetic number, because the mean of its divisors is an integer number (24606105773361).
Almost surely, 2131232323310134 is an apocalyptic number.
131232323310134 is a deficient number, since it is larger than the sum of its proper divisors (65616522876754).
131232323310134 is a wasteful number, since it uses less digits than its factorization.
131232323310134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120407230.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 131232323310134 its reverse (431013323232131), we get a palindrome (562245646542265).
The spelling of 131232323310134 in words is "one hundred thirty-one trillion, two hundred thirty-two billion, three hundred twenty-three million, three hundred ten thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •