Base | Representation |
---|---|
bin | 1100000010000110000000… |
… | …1100011000111100010111 |
3 | 1201211210020022221211111121 |
4 | 3000201200030120330113 |
5 | 3213230232430213221 |
6 | 44045455143344411 |
7 | 2533562352063145 |
oct | 300414014307427 |
9 | 51753208854447 |
10 | 13230113132311 |
11 | 424094aa559a9 |
12 | 1598102152107 |
13 | 74c79593067a |
14 | 33a4ab5a0595 |
15 | 17e22b630a41 |
hex | c0860318f17 |
13230113132311 has 8 divisors (see below), whose sum is σ = 13244960208240. Its totient is φ = 13215271315008.
The previous prime is 13230113132309. The next prime is 13230113132329. The reversal of 13230113132311 is 11323131103231.
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 13230113132311 - 21 = 13230113132309 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 (13230113132381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3730795 + ... + 6354451.
It is an arithmetic number, because the mean of its divisors is an integer number (1655620026030).
Almost surely, 213230113132311 is an apocalyptic number.
13230113132311 is a deficient number, since it is larger than the sum of its proper divisors (14847075929).
13230113132311 is a wasteful number, since it uses less digits than its factorization.
13230113132311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2629313.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 13230113132311 its reverse (11323131103231), we get a palindrome (24553244235542).
The spelling of 13230113132311 in words is "thirteen trillion, two hundred thirty billion, one hundred thirteen million, one hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •