Base | Representation |
---|---|
bin | 1011011001100100111110… |
… | …1111111000100011110111 |
3 | 1122101020120200010011211001 |
4 | 2312121033233320203313 |
5 | 3120324214421202411 |
6 | 42354021513024131 |
7 | 2432361335365342 |
oct | 266311757704367 |
9 | 48336520104731 |
10 | 12534052522231 |
11 | 3aa2730983259 |
12 | 14a52249b5047 |
13 | 6cbc576835a6 |
14 | 314919553459 |
15 | 16b08d329dc1 |
hex | b664fbf88f7 |
12534052522231 has 8 divisors (see below), whose sum is σ = 12631297870080. Its totient is φ = 12437109649272.
The previous prime is 12534052522171. The next prime is 12534052522297. The reversal of 12534052522231 is 13222525043521.
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 12534052522231 - 215 = 12534052489463 is a prime.
It is a super-2 number, since 2×125340525222312 (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 (12534052582231) 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, 75535525 + ... + 75701278.
It is an arithmetic number, because the mean of its divisors is an integer number (1578912233760).
Almost surely, 212534052522231 is an apocalyptic number.
12534052522231 is a deficient number, since it is larger than the sum of its proper divisors (97245347849).
12534052522231 is a wasteful number, since it uses less digits than its factorization.
12534052522231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151237445.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 12534052522231 its reverse (13222525043521), we get a palindrome (25756577565752).
The spelling of 12534052522231 in words is "twelve trillion, five hundred thirty-four billion, fifty-two million, five hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •