Base | Representation |
---|---|
bin | 11001111000011010… |
… | …11100111010010101 |
3 | 1022212101000020112010 |
4 | 30330031130322111 |
5 | 211424113424031 |
6 | 10214443214433 |
7 | 1001222033223 |
oct | 147415347225 |
9 | 38771006463 |
10 | 13895061141 |
11 | 5990444105 |
12 | 2839517419 |
13 | 1405959390 |
14 | 95b59bb13 |
15 | 564d05246 |
hex | 33c35ce95 |
13895061141 has 48 divisors (see below), whose sum is σ = 20724817344. Its totient is φ = 8230864896.
The previous prime is 13895061137. The next prime is 13895061179. The reversal of 13895061141 is 14116059831.
It is not a de Polignac number, because 13895061141 - 22 = 13895061137 is a prime.
It is a super-2 number, since 2×138950611412 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 13895061141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13895061641) 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 47 ways as a sum of consecutive naturals, for example, 5177586 + ... + 5180268.
It is an arithmetic number, because the mean of its divisors is an integer number (431767028).
Almost surely, 213895061141 is an apocalyptic number.
It is an amenable number.
13895061141 is a deficient number, since it is larger than the sum of its proper divisors (6829756203).
13895061141 is a wasteful number, since it uses less digits than its factorization.
13895061141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2870 (or 2833 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 39.
The spelling of 13895061141 in words is "thirteen billion, eight hundred ninety-five million, sixty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •