Base | Representation |
---|---|
bin | 1011011011010001000011… |
… | …0000101100001101000111 |
3 | 1122111000110021211011201002 |
4 | 2312310100300230031013 |
5 | 3121313121444241411 |
6 | 42415220151323515 |
7 | 2434436231436365 |
oct | 266642060541507 |
9 | 48430407734632 |
10 | 12563060540231 |
11 | 4003a6717a553 |
12 | 14aa97b68059b |
13 | 7018cb387b96 |
14 | 3160abd3a635 |
15 | 16bbd9d0833b |
hex | b6d10c2c347 |
12563060540231 has 8 divisors (see below), whose sum is σ = 12907578751824. Its totient is φ = 12218804225280.
The previous prime is 12563060540209. The next prime is 12563060540279. The reversal of 12563060540231 is 13204506036521.
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 12563060540231 - 210 = 12563060539207 is a prime.
It is a super-2 number, since 2×125630605402312 (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 (12563060540131) 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, 65376905 + ... + 65568786.
It is an arithmetic number, because the mean of its divisors is an integer number (1613447343978).
Almost surely, 212563060540231 is an apocalyptic number.
12563060540231 is a deficient number, since it is larger than the sum of its proper divisors (344518211593).
12563060540231 is a wasteful number, since it uses less digits than its factorization.
12563060540231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130948321.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 12563060540231 its reverse (13204506036521), we get a palindrome (25767566576752).
The spelling of 12563060540231 in words is "twelve trillion, five hundred sixty-three billion, sixty million, five hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •