Base | Representation |
---|---|
bin | 1011111100010110010001… |
… | …1100000110000001111011 |
3 | 1201111100102211222202000202 |
4 | 2333011210130012001323 |
5 | 3210121101412011303 |
6 | 43532252032552415 |
7 | 2523466223200604 |
oct | 277054434060173 |
9 | 51440384882022 |
10 | 13131400110203 |
11 | 4202aa50333a1 |
12 | 1580b533b270b |
13 | 74339394990b |
14 | 3357c5430dab |
15 | 17b8a03b2c88 |
hex | bf16470607b |
13131400110203 has 4 divisors (see below), whose sum is σ = 13131432693120. Its totient is φ = 13131367527288.
The previous prime is 13131400110181. The next prime is 13131400110209. The reversal of 13131400110203 is 30201100413131.
13131400110203 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 is a cyclic number.
It is not a de Polignac number, because 13131400110203 - 26 = 13131400110139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13131400110209) 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, 15679268 + ... + 16495521.
It is an arithmetic number, because the mean of its divisors is an integer number (3282858173280).
Almost surely, 213131400110203 is an apocalyptic number.
13131400110203 is a deficient number, since it is larger than the sum of its proper divisors (32582917).
13131400110203 is an equidigital number, since it uses as much as digits as its factorization.
13131400110203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32582916.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13131400110203 its reverse (30201100413131), we get a palindrome (43332500523334).
The spelling of 13131400110203 in words is "thirteen trillion, one hundred thirty-one billion, four hundred million, one hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •