Base | Representation |
---|---|
bin | 1011111100111111010101… |
… | …1001010110000011111111 |
3 | 1201112101212222122210100010 |
4 | 2333033311121112003333 |
5 | 3210311140014122401 |
6 | 43541313442434303 |
7 | 2524336316656461 |
oct | 277176531260377 |
9 | 51471788583303 |
10 | 13142422020351 |
11 | 4207740676648 |
12 | 158310a662993 |
13 | 74442c275c40 |
14 | 33614d1a6131 |
15 | 17bce7d2ded6 |
hex | bf3f56560ff |
13142422020351 has 64 divisors (see below), whose sum is σ = 20048655513600. Its totient is φ = 7599914520576.
The previous prime is 13142422020349. The next prime is 13142422020379. The reversal of 13142422020351 is 15302022424131.
It is a happy number.
It is not a de Polignac number, because 13142422020351 - 21 = 13142422020349 is a prime.
It is a super-2 number, since 2×131424220203512 (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 (13142422020251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8824495 + ... + 10205711.
It is an arithmetic number, because the mean of its divisors is an integer number (313260242400).
Almost surely, 213142422020351 is an apocalyptic number.
13142422020351 is a deficient number, since it is larger than the sum of its proper divisors (6906233493249).
13142422020351 is a wasteful number, since it uses less digits than its factorization.
13142422020351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1381488.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 13142422020351 its reverse (15302022424131), we get a palindrome (28444444444482).
The spelling of 13142422020351 in words is "thirteen trillion, one hundred forty-two billion, four hundred twenty-two million, twenty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •