Base | Representation |
---|---|
bin | 10001011110111001101… |
… | …000101111010100100011 |
3 | 11020212001100111210221010 |
4 | 101132321220233110203 |
5 | 124140442021341011 |
6 | 2315530441032003 |
7 | 152541032252601 |
oct | 21367150572443 |
9 | 4225040453833 |
10 | 1201410340131 |
11 | 4235738a8551 |
12 | 174a11a85603 |
13 | 893a5846ab1 |
14 | 4221196c871 |
15 | 213b89241a6 |
hex | 117b9a2f523 |
1201410340131 has 8 divisors (see below), whose sum is σ = 1611472552704. Its totient is φ = 796144177160.
The previous prime is 1201410340051. The next prime is 1201410340159. The reversal of 1201410340131 is 1310430141021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1201410340131 - 27 = 1201410340003 is a prime.
It is a super-2 number, since 2×12014103401312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1201410340098 and 1201410340107.
It is not an unprimeable number, because it can be changed into a prime (1201410340931) 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, 1199011815 + ... + 1199012816.
It is an arithmetic number, because the mean of its divisors is an integer number (201434069088).
Almost surely, 21201410340131 is an apocalyptic number.
1201410340131 is a deficient number, since it is larger than the sum of its proper divisors (410062212573).
1201410340131 is a wasteful number, since it uses less digits than its factorization.
1201410340131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2398024801.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1201410340131 its reverse (1310430141021), we get a palindrome (2511840481152).
The spelling of 1201410340131 in words is "one trillion, two hundred one billion, four hundred ten million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •