Base | Representation |
---|---|
bin | 11000010010011111… |
… | …01100111101000010 |
3 | 1020122210002022010222 |
4 | 30021033230331002 |
5 | 203201220404442 |
6 | 5553540423042 |
7 | 641100165653 |
oct | 141117547502 |
9 | 36583068128 |
10 | 13040013122 |
11 | 5591824954 |
12 | 263b0a7a82 |
13 | 12ca7714c6 |
14 | 8b9bc352a |
15 | 514c078d2 |
hex | 3093ecf42 |
13040013122 has 4 divisors (see below), whose sum is σ = 19560019686. Its totient is φ = 6520006560.
The previous prime is 13040013121. The next prime is 13040013167. The reversal of 13040013122 is 22131004031.
13040013122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 11293525441 + 1746487681 = 106271^2 + 41791^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 13040013122.
It is not an unprimeable number, because it can be changed into a prime (13040013121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3260003279 + ... + 3260003282.
Almost surely, 213040013122 is an apocalyptic number.
13040013122 is a deficient number, since it is larger than the sum of its proper divisors (6520006564).
13040013122 is an equidigital number, since it uses as much as digits as its factorization.
13040013122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6520006563.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13040013122 its reverse (22131004031), we get a palindrome (35171017153).
Subtracting 13040013122 from its reverse (22131004031), we obtain a palindrome (9090990909).
The spelling of 13040013122 in words is "thirteen billion, forty million, thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •