Base | Representation |
---|---|
bin | 1010010010100100101110… |
… | …1010010111110101010011 |
3 | 1111001121221222022221121002 |
4 | 2210221023222113311103 |
5 | 2440333002043202111 |
6 | 40021402224052215 |
7 | 2245265515613453 |
oct | 244511352276523 |
9 | 44047858287532 |
10 | 11314213256531 |
11 | 3672370471209 |
12 | 132892b16406b |
13 | 640c05aaaa13 |
14 | 2b187a223d63 |
15 | 149496a7363b |
hex | a4a4ba97d53 |
11314213256531 has 16 divisors (see below), whose sum is σ = 11742321100608. Its totient is φ = 10894049088000.
The previous prime is 11314213256527. The next prime is 11314213256609. The reversal of 11314213256531 is 13565231241311.
It is a cyclic number.
It is not a de Polignac number, because 11314213256531 - 22 = 11314213256527 is a prime.
It is a super-2 number, since 2×113142132565312 (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 (11314213216531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3068471 + ... + 5660736.
It is an arithmetic number, because the mean of its divisors is an integer number (733895068788).
Almost surely, 211314213256531 is an apocalyptic number.
11314213256531 is a deficient number, since it is larger than the sum of its proper divisors (428107844077).
11314213256531 is a wasteful number, since it uses less digits than its factorization.
11314213256531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8729662.
The product of its digits is 64800, while the sum is 38.
Adding to 11314213256531 its reverse (13565231241311), we get a palindrome (24879444497842).
The spelling of 11314213256531 in words is "eleven trillion, three hundred fourteen billion, two hundred thirteen million, two hundred fifty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •