Base | Representation |
---|---|
bin | 11101110101001110110101… |
… | …000110010001000111110001 |
3 | 122012112201202110011201220210 |
4 | 131311032311012101013301 |
5 | 114144100434000410001 |
6 | 1143013032033454333 |
7 | 36430663051640664 |
oct | 3565166506210761 |
9 | 565481673151823 |
10 | 131201404310001 |
11 | 388942263571a3 |
12 | 1286b864a113a9 |
13 | 5829315a9a34c |
14 | 2458278ddb6db |
15 | 1027cb26cadd6 |
hex | 7753b51911f1 |
131201404310001 has 8 divisors (see below), whose sum is σ = 174943698241600. Its totient is φ = 87463356625872.
The previous prime is 131201404309979. The next prime is 131201404310003. The reversal of 131201404310001 is 100013404102131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131201404310001 - 213 = 131201404301809 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131201404310001.
It is not an unprimeable number, because it can be changed into a prime (131201404310003) 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, 1061489770 + ... + 1061613363.
It is an arithmetic number, because the mean of its divisors is an integer number (21867962280200).
Almost surely, 2131201404310001 is an apocalyptic number.
It is an amenable number.
131201404310001 is a deficient number, since it is larger than the sum of its proper divisors (43742293931599).
131201404310001 is a wasteful number, since it uses less digits than its factorization.
131201404310001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2123123735.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 131201404310001 its reverse (100013404102131), we get a palindrome (231214808412132).
The spelling of 131201404310001 in words is "one hundred thirty-one trillion, two hundred one billion, four hundred four million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •