Base | Representation |
---|---|
bin | 11000011110100000… |
… | …00100000001001111 |
3 | 1020220210200022211100 |
4 | 30033100010001033 |
5 | 203403014132040 |
6 | 10011540154143 |
7 | 643432465260 |
oct | 141720040117 |
9 | 36823608740 |
10 | 13140770895 |
11 | 563369373a |
12 | 2668998953 |
13 | 13155bbba5 |
14 | 8c9330967 |
15 | 51d9abb30 |
hex | 30f40404f |
13140770895 has 96 divisors (see below), whose sum is σ = 27280281600. Its totient is φ = 5721230592.
The previous prime is 13140770833. The next prime is 13140770933. The reversal of 13140770895 is 59807704131.
It is not a de Polignac number, because 13140770895 - 214 = 13140754511 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 13140770895.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1727761 + ... + 1735349.
It is an arithmetic number, because the mean of its divisors is an integer number (284169600).
Almost surely, 213140770895 is an apocalyptic number.
13140770895 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13140770895 is an abundant number, since it is smaller than the sum of its proper divisors (14139510705).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13140770895 is a wasteful number, since it uses less digits than its factorization.
13140770895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7869 (or 7866 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 45.
The spelling of 13140770895 in words is "thirteen billion, one hundred forty million, seven hundred seventy thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •