Base | Representation |
---|---|
bin | 1011111100111111010101… |
… | …1111001011111000010111 |
3 | 1201112101220002112120200202 |
4 | 2333033311133023320113 |
5 | 3210311140412122021 |
6 | 43541313535331115 |
7 | 2524336335664502 |
oct | 277176537137027 |
9 | 51471802476622 |
10 | 13142423551511 |
11 | 4207741521a71 |
12 | 158310b080a9b |
13 | 74442c690b57 |
14 | 33614d484139 |
15 | 17bce8032a0b |
hex | bf3f57cbe17 |
13142423551511 has 8 divisors (see below), whose sum is σ = 13184838414384. Its totient is φ = 13100011404480.
The previous prime is 13142423551463. The next prime is 13142423551549. The reversal of 13142423551511 is 11515532424131.
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 13142423551511 - 238 = 12867545644567 is a prime.
It is a super-2 number, since 2×131424235515112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142423551591) 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, 9248801 + ... + 10574741.
It is an arithmetic number, because the mean of its divisors is an integer number (1648104801798).
Almost surely, 213142423551511 is an apocalyptic number.
13142423551511 is a deficient number, since it is larger than the sum of its proper divisors (42414862873).
13142423551511 is a wasteful number, since it uses less digits than its factorization.
13142423551511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1357921.
The product of its digits is 72000, while the sum is 38.
Adding to 13142423551511 its reverse (11515532424131), we get a palindrome (24657955975642).
The spelling of 13142423551511 in words is "thirteen trillion, one hundred forty-two billion, four hundred twenty-three million, five hundred fifty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •