Base | Representation |
---|---|
bin | 1011111011010110010000… |
… | …0000111001000110111011 |
3 | 1201102201002001121200100012 |
4 | 2332311210000321012323 |
5 | 3204330402024011303 |
6 | 43520330351532135 |
7 | 2522320266125102 |
oct | 276654400710673 |
9 | 51381061550305 |
10 | 13114213110203 |
11 | 41a6785460967 |
12 | 157975752a04b |
13 | 741884ca142a |
14 | 334a34995039 |
15 | 17b1e659d5d8 |
hex | bed640391bb |
13114213110203 has 8 divisors (see below), whose sum is σ = 13151471649600. Its totient is φ = 13076962859520.
The previous prime is 13114213110157. The next prime is 13114213110221. The reversal of 13114213110203 is 30201131241131.
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 13114213110203 - 28 = 13114213109947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13114213110223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1103573 + ... + 5238921.
It is an arithmetic number, because the mean of its divisors is an integer number (1643933956200).
Almost surely, 213114213110203 is an apocalyptic number.
13114213110203 is a deficient number, since it is larger than the sum of its proper divisors (37258539397).
13114213110203 is an equidigital number, since it uses as much as digits as its factorization.
13114213110203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4144357.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13114213110203 its reverse (30201131241131), we get a palindrome (43315344351334).
The spelling of 13114213110203 in words is "thirteen trillion, one hundred fourteen billion, two hundred thirteen million, one hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •