Base | Representation |
---|---|
bin | 11001101001101000… |
… | …01000100101111101 |
3 | 1022112201112110102020 |
4 | 30310310020211331 |
5 | 211200332440210 |
6 | 10154251550353 |
7 | 665154300555 |
oct | 146464104575 |
9 | 38481473366 |
10 | 13770983805 |
11 | 59273a7a57 |
12 | 2803a5b3b9 |
13 | 13b6035637 |
14 | 948d00165 |
15 | 558e96770 |
hex | 334d0897d |
13770983805 has 8 divisors (see below), whose sum is σ = 22033574112. Its totient is φ = 7344524688.
The previous prime is 13770983801. The next prime is 13770983833. The reversal of 13770983805 is 50838907731.
13770983805 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13770983805 - 22 = 13770983801 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13770983801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 459032779 + ... + 459032808.
It is an arithmetic number, because the mean of its divisors is an integer number (2754196764).
Almost surely, 213770983805 is an apocalyptic number.
13770983805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13770983805 is a deficient number, since it is larger than the sum of its proper divisors (8262590307).
13770983805 is an equidigital number, since it uses as much as digits as its factorization.
13770983805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918065595.
The product of its (nonzero) digits is 1270080, while the sum is 51.
The spelling of 13770983805 in words is "thirteen billion, seven hundred seventy million, nine hundred eighty-three thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •