Base | Representation |
---|---|
bin | 1011111100110111111000… |
… | …1111101101010000010011 |
3 | 1201112012201200011022002001 |
4 | 2333031332033231100103 |
5 | 3210243041242131303 |
6 | 43540343232534431 |
7 | 2524235634426124 |
oct | 277157617552023 |
9 | 51465650138061 |
10 | 13140423005203 |
11 | 4206905241a0a |
12 | 15828510b1417 |
13 | 7441a1084c40 |
14 | 335ddd8c604b |
15 | 17bc2c5b331d |
hex | bf37e3ed413 |
13140423005203 has 8 divisors (see below), whose sum is σ = 14151513096000. Its totient is φ = 12129374103168.
The previous prime is 13140423005191. The next prime is 13140423005209. The reversal of 13140423005203 is 30250032404131.
It is a happy number.
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 13140423005203 - 29 = 13140423004691 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13140423005209) 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, 9632998 + ... + 10912171.
It is an arithmetic number, because the mean of its divisors is an integer number (1768939137000).
Almost surely, 213140423005203 is an apocalyptic number.
13140423005203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13140423005203 is a deficient number, since it is larger than the sum of its proper divisors (1011090090797).
13140423005203 is a wasteful number, since it uses less digits than its factorization.
13140423005203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20594381.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 13140423005203 its reverse (30250032404131), we get a palindrome (43390455409334).
The spelling of 13140423005203 in words is "thirteen trillion, one hundred forty billion, four hundred twenty-three million, five thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •