Base | Representation |
---|---|
bin | 1011111100110111100101… |
… | …1111011000111000110001 |
3 | 1201112012112010001022001221 |
4 | 2333031321133120320301 |
5 | 3210242410331330001 |
6 | 43540331303025041 |
7 | 2524233645360301 |
oct | 277157137307061 |
9 | 51465463038057 |
10 | 13140343230001 |
11 | 4206874204699 |
12 | 158282a43b181 |
13 | 74418a6a2c90 |
14 | 335dd307b601 |
15 | 17bc255a61a1 |
hex | bf3797d8e31 |
13140343230001 has 8 divisors (see below), whose sum is σ = 14151173105664. Its totient is φ = 12129518246160.
The previous prime is 13140343229969. The next prime is 13140343230019. The reversal of 13140343230001 is 10003234304131.
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 13140343230001 - 25 = 13140343229969 is a prime.
It is a super-2 number, since 2×131403432300012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13140343230061) 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, 5887056 + ... + 7806286.
It is an arithmetic number, because the mean of its divisors is an integer number (1768896638208).
Almost surely, 213140343230001 is an apocalyptic number.
It is an amenable number.
13140343230001 is a deficient number, since it is larger than the sum of its proper divisors (1010829875663).
13140343230001 is a wasteful number, since it uses less digits than its factorization.
13140343230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445911.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13140343230001 its reverse (10003234304131), we get a palindrome (23143577534132).
The spelling of 13140343230001 in words is "thirteen trillion, one hundred forty billion, three hundred forty-three million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •