Base | Representation |
---|---|
bin | 1100000110010010101011… |
… | …0001110101100000110111 |
3 | 1202002200101101020120222001 |
4 | 3001210222301311200313 |
5 | 3220420432221014111 |
6 | 44142543304520131 |
7 | 2542024460326405 |
oct | 301445261654067 |
9 | 52080341216861 |
10 | 13302231423031 |
11 | 4269498939161 |
12 | 15aa08a480047 |
13 | 756519b9b285 |
14 | 33db8d664475 |
15 | 18104cbbd1c1 |
hex | c192ac75837 |
13302231423031 has 8 divisors (see below), whose sum is σ = 13439440488320. Its totient is φ = 13165023840768.
The previous prime is 13302231423017. The next prime is 13302231423059. The reversal of 13302231423031 is 13032413220331.
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 13302231423031 - 211 = 13302231420983 is a prime.
It is a super-2 number, since 2×133022314230312 (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 (13302231426031) 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, 34118650 + ... + 34506328.
It is an arithmetic number, because the mean of its divisors is an integer number (1679930061040).
Almost surely, 213302231423031 is an apocalyptic number.
13302231423031 is a deficient number, since it is larger than the sum of its proper divisors (137209065289).
13302231423031 is an equidigital number, since it uses as much as digits as its factorization.
13302231423031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741513.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 13302231423031 its reverse (13032413220331), we get a palindrome (26334644643362).
The spelling of 13302231423031 in words is "thirteen trillion, three hundred two billion, two hundred thirty-one million, four hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •