Base | Representation |
---|---|
bin | 1011000110001110010010… |
… | …0010000000011001101111 |
3 | 1121012110022101110220200210 |
4 | 2301203210202000121233 |
5 | 3044402224024143211 |
6 | 41541151034153503 |
7 | 2366350365206604 |
oct | 261434442003157 |
9 | 47173271426623 |
10 | 12201541240431 |
11 | 398470aa33824 |
12 | 14508a7582893 |
13 | 6a67a611033a |
14 | 3027b465a6ab |
15 | 1625cb8389a6 |
hex | b18e488066f |
12201541240431 has 16 divisors (see below), whose sum is σ = 16319671004000. Its totient is φ = 8108898536448.
The previous prime is 12201541240411. The next prime is 12201541240433. The reversal of 12201541240431 is 13404214510221.
It is not a de Polignac number, because 12201541240431 - 26 = 12201541240367 is a prime.
It is a super-2 number, since 2×122015412404312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201541240433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2400135 + ... + 5492151.
It is an arithmetic number, because the mean of its divisors is an integer number (1019979437750).
Almost surely, 212201541240431 is an apocalyptic number.
12201541240431 is a deficient number, since it is larger than the sum of its proper divisors (4118129763569).
12201541240431 is a wasteful number, since it uses less digits than its factorization.
12201541240431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3096138.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 12201541240431 its reverse (13404214510221), we get a palindrome (25605755750652).
The spelling of 12201541240431 in words is "twelve trillion, two hundred one billion, five hundred forty-one million, two hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •