Base | Representation |
---|---|
bin | 11001101101001101… |
… | …11000001101101101 |
3 | 1022121211010122200202 |
4 | 30312212320031231 |
5 | 211231033011102 |
6 | 10201244403245 |
7 | 666001050041 |
oct | 146646701555 |
9 | 38554118622 |
10 | 13801063277 |
11 | 5942382121 |
12 | 2811b46525 |
13 | 13bc337841 |
14 | 94ccd0021 |
15 | 55b938e02 |
hex | 3369b836d |
13801063277 has 4 divisors (see below), whose sum is σ = 13804235196. Its totient is φ = 13797891360.
The previous prime is 13801063271. The next prime is 13801063337. The reversal of 13801063277 is 77236010831.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13167333001 + 633730276 = 114749^2 + 25174^2 .
It is a cyclic number.
It is not a de Polignac number, because 13801063277 - 222 = 13796868973 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13801063277.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13801063271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1579424 + ... + 1588137.
It is an arithmetic number, because the mean of its divisors is an integer number (3451058799).
Almost surely, 213801063277 is an apocalyptic number.
It is an amenable number.
13801063277 is a deficient number, since it is larger than the sum of its proper divisors (3171919).
13801063277 is an equidigital number, since it uses as much as digits as its factorization.
13801063277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3171918.
The product of its (nonzero) digits is 42336, while the sum is 38.
The spelling of 13801063277 in words is "thirteen billion, eight hundred one million, sixty-three thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •