Base | Representation |
---|---|
bin | 1011111100111111010101… |
… | …0001110000011001111101 |
3 | 1201112101212211220201121012 |
4 | 2333033311101300121331 |
5 | 3210311134011443401 |
6 | 43541313332045005 |
7 | 2524336264033064 |
oct | 277176521603175 |
9 | 51471784821535 |
10 | 13142420031101 |
11 | 420773a538039 |
12 | 1583109a63765 |
13 | 74442ba2a67a |
14 | 33614cc091db |
15 | 17bce7a898bb |
hex | bf3f547067d |
13142420031101 has 4 divisors (see below), whose sum is σ = 13142504611104. Its totient is φ = 13142335451100.
The previous prime is 13142420031077. The next prime is 13142420031121. The reversal of 13142420031101 is 10113002424131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13142420031101 - 230 = 13141346289277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142420031121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42056495 + ... + 42367836.
It is an arithmetic number, because the mean of its divisors is an integer number (3285626152776).
Almost surely, 213142420031101 is an apocalyptic number.
It is an amenable number.
13142420031101 is a deficient number, since it is larger than the sum of its proper divisors (84580003).
13142420031101 is an equidigital number, since it uses as much as digits as its factorization.
13142420031101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84580002.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13142420031101 its reverse (10113002424131), we get a palindrome (23255422455232).
The spelling of 13142420031101 in words is "thirteen trillion, one hundred forty-two billion, four hundred twenty million, thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •