Base | Representation |
---|---|
bin | 1100000110001110100100… |
… | …1100110100011000010111 |
3 | 1202002120112200222110201202 |
4 | 3001203221030310120113 |
5 | 3220411204041400043 |
6 | 44142242203143115 |
7 | 2541655300514222 |
oct | 301435114643027 |
9 | 52076480873652 |
10 | 13301131200023 |
11 | 4268a83891347 |
12 | 15a9a21b14a9b |
13 | 7563a2c6cc44 |
14 | 33dac74a85b9 |
15 | 180ed62e11b8 |
hex | c18e9334617 |
13301131200023 has 8 divisors (see below), whose sum is σ = 13563634970880. Its totient is φ = 13040509177080.
The previous prime is 13301131199971. The next prime is 13301131200031. The reversal of 13301131200023 is 32000213110331.
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 13301131200023 - 224 = 13301114422807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13301131199968 and 13301131200004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301131200323) 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, 470422703 + ... + 470450976.
It is an arithmetic number, because the mean of its divisors is an integer number (1695454371360).
Almost surely, 213301131200023 is an apocalyptic number.
13301131200023 is a deficient number, since it is larger than the sum of its proper divisors (262503770857).
13301131200023 is an equidigital number, since it uses as much as digits as its factorization.
13301131200023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 940873957.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13301131200023 its reverse (32000213110331), we get a palindrome (45301344310354).
The spelling of 13301131200023 in words is "thirteen trillion, three hundred one billion, one hundred thirty-one million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •