Base | Representation |
---|---|
bin | 10001111010111100111… |
… | …010100011000110110101 |
3 | 11100201210110011201121122 |
4 | 101322330322203012311 |
5 | 130134133202031123 |
6 | 2341431312153325 |
7 | 154655315141060 |
oct | 21727472430665 |
9 | 4321713151548 |
10 | 1231530111413 |
11 | 43531a707508 |
12 | 17a818b38845 |
13 | 8c195985974 |
14 | 4386bc738d7 |
15 | 2207cd0abc8 |
hex | 11ebcea31b5 |
1231530111413 has 8 divisors (see below), whose sum is σ = 1428469895232. Its totient is φ = 1039842055296.
The previous prime is 1231530111353. The next prime is 1231530111467. The reversal of 1231530111413 is 3141110351321.
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 1231530111413 - 28 = 1231530111157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231530111473) 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 7 ways as a sum of consecutive naturals, for example, 1312931420 + ... + 1312932357.
It is an arithmetic number, because the mean of its divisors is an integer number (178558736904).
Almost surely, 21231530111413 is an apocalyptic number.
It is an amenable number.
1231530111413 is a deficient number, since it is larger than the sum of its proper divisors (196939783819).
1231530111413 is an equidigital number, since it uses as much as digits as its factorization.
1231530111413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2625863851.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 1231530111413 its reverse (3141110351321), we get a palindrome (4372640462734).
The spelling of 1231530111413 in words is "one trillion, two hundred thirty-one billion, five hundred thirty million, one hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •