Base | Representation |
---|---|
bin | 1100000010101011010101… |
… | …1011010010000000100111 |
3 | 1201212202002122011120122102 |
4 | 3000222311123102000213 |
5 | 3213411243024042043 |
6 | 44054233320522315 |
7 | 2534365560614450 |
oct | 300526533220047 |
9 | 51782078146572 |
10 | 13240133034023 |
11 | 4245121a23405 |
12 | 159a03992039b |
13 | 7507017985ac |
14 | 33ab7c224127 |
15 | 17e6161206b8 |
hex | c0ab56d2027 |
13240133034023 has 16 divisors (see below), whose sum is σ = 15830065405440. Its totient is φ = 10827358735776.
The previous prime is 13240133034017. The next prime is 13240133034053. The reversal of 13240133034023 is 32043033104231.
It is a cyclic number.
It is not a de Polignac number, because 13240133034023 - 210 = 13240133032999 is a prime.
It is a super-2 number, since 2×132401330340232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13240133034053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105640265 + ... + 105765522.
It is an arithmetic number, because the mean of its divisors is an integer number (989379087840).
Almost surely, 213240133034023 is an apocalyptic number.
13240133034023 is a deficient number, since it is larger than the sum of its proper divisors (2589932371417).
13240133034023 is a wasteful number, since it uses less digits than its factorization.
13240133034023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211406206.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 13240133034023 its reverse (32043033104231), we get a palindrome (45283166138254).
The spelling of 13240133034023 in words is "thirteen trillion, two hundred forty billion, one hundred thirty-three million, thirty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •