Base | Representation |
---|---|
bin | 1011111010100001010101… |
… | …1101011110011001011111 |
3 | 1201101100102020112012212120 |
4 | 2332220111131132121133 |
5 | 3204112310114113043 |
6 | 43510021152234023 |
7 | 2521305316212132 |
oct | 276502535363137 |
9 | 51340366465776 |
10 | 13100010301023 |
11 | 41a0757331138 |
12 | 1576a52b3b913 |
13 | 740430663729 |
14 | 3340885a8219 |
15 | 17ab64758983 |
hex | bea1575e65f |
13100010301023 has 8 divisors (see below), whose sum is σ = 17469528409008. Its totient is φ = 8731916196864.
The previous prime is 13100010301013. The next prime is 13100010301051. The reversal of 13100010301023 is 32010301000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13100010301023 - 26 = 13100010300959 is a prime.
It is a super-2 number, since 2×131000103010232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13100010300993 and 13100010301011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100010301013) 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, 355979490 + ... + 356016287.
It is an arithmetic number, because the mean of its divisors is an integer number (2183691051126).
Almost surely, 213100010301023 is an apocalyptic number.
13100010301023 is a deficient number, since it is larger than the sum of its proper divisors (4369518107985).
13100010301023 is an equidigital number, since it uses as much as digits as its factorization.
13100010301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712001913.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13100010301023 its reverse (32010301000131), we get a palindrome (45110311301154).
The spelling of 13100010301023 in words is "thirteen trillion, one hundred billion, ten million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •