Base | Representation |
---|---|
bin | 1100000010110111100010… |
… | …1111111101001110010111 |
3 | 1201220001120000101021000020 |
4 | 3000231320233331032113 |
5 | 3213440000430323111 |
6 | 44055534421520223 |
7 | 2534543021510334 |
oct | 300557057751627 |
9 | 51801500337006 |
10 | 13243410011031 |
11 | 4246553772772 |
12 | 159a7b3273073 |
13 | 750b04679545 |
14 | 33adad52998b |
15 | 17e758b76906 |
hex | c0b78bfd397 |
13243410011031 has 16 divisors (see below), whose sum is σ = 17679039350400. Its totient is φ = 8818364099168.
The previous prime is 13243410011023. The next prime is 13243410011047. The reversal of 13243410011031 is 13011001434231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13243410011031 - 23 = 13243410011023 is a prime.
It is a super-2 number, since 2×132434100110312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13243410010992 and 13243410011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13243410011011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13708180 + ... + 14642438.
It is an arithmetic number, because the mean of its divisors is an integer number (1104939959400).
Almost surely, 213243410011031 is an apocalyptic number.
13243410011031 is a deficient number, since it is larger than the sum of its proper divisors (4435629339369).
13243410011031 is a wasteful number, since it uses less digits than its factorization.
13243410011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 939918.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13243410011031 its reverse (13011001434231), we get a palindrome (26254411445262).
The spelling of 13243410011031 in words is "thirteen trillion, two hundred forty-three billion, four hundred ten million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •