Base | Representation |
---|---|
bin | 1011110111000011010010… |
… | …1011000011101001100111 |
3 | 1201011122120012112101011101 |
4 | 2331300310223003221213 |
5 | 3202123222012204111 |
6 | 43422402403220531 |
7 | 2514065243424052 |
oct | 275606453035147 |
9 | 51148505471141 |
10 | 13040404413031 |
11 | 417844a368286 |
12 | 1567399077747 |
13 | 737921765b18 |
14 | 3312321c5a99 |
15 | 179326904bc1 |
hex | bdc34ac3a67 |
13040404413031 has 4 divisors (see below), whose sum is σ = 13047929172072. Its totient is φ = 13032879653992.
The previous prime is 13040404413013. The next prime is 13040404413037. The reversal of 13040404413031 is 13031440404031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13040404413031 - 223 = 13040396024423 is a prime.
It is a super-2 number, since 2×130404044130312 (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 (13040404413037) 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, 3762376921 + ... + 3762380386.
It is an arithmetic number, because the mean of its divisors is an integer number (3261982293018).
Almost surely, 213040404413031 is an apocalyptic number.
13040404413031 is a deficient number, since it is larger than the sum of its proper divisors (7524759041).
13040404413031 is an equidigital number, since it uses as much as digits as its factorization.
13040404413031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7524759040.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 13040404413031 its reverse (13031440404031), we get a palindrome (26071844817062).
The spelling of 13040404413031 in words is "thirteen trillion, forty billion, four hundred four million, four hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •