Base | Representation |
---|---|
bin | 1011001110111000101000… |
… | …1111111111000001110011 |
3 | 1121201200102011012120221212 |
4 | 2303232022033333001303 |
5 | 3104322004202002011 |
6 | 42133401143310335 |
7 | 2413166124323441 |
oct | 263561217770163 |
9 | 47650364176855 |
10 | 12350350422131 |
11 | 3a31832927517 |
12 | 14756b744b3ab |
13 | 6b782ca61587 |
14 | 309a8dbcbb91 |
15 | 1663daae308b |
hex | b3b8a3ff073 |
12350350422131 has 4 divisors (see below), whose sum is σ = 12350477791200. Its totient is φ = 12350223053064.
The previous prime is 12350350422043. The next prime is 12350350422203. The reversal of 12350350422131 is 13122405305321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12350350422131 is a prime.
It is a super-2 number, since 2×123503504221312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12350350422931) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63538976 + ... + 63733053.
It is an arithmetic number, because the mean of its divisors is an integer number (3087619447800).
Almost surely, 212350350422131 is an apocalyptic number.
12350350422131 is a deficient number, since it is larger than the sum of its proper divisors (127369069).
12350350422131 is an equidigital number, since it uses as much as digits as its factorization.
12350350422131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127369068.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 12350350422131 its reverse (13122405305321), we get a palindrome (25472755727452).
The spelling of 12350350422131 in words is "twelve trillion, three hundred fifty billion, three hundred fifty million, four hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •