Base | Representation |
---|---|
bin | 11110000011100111… |
… | …01100010001100110 |
3 | 1112122120120212020111 |
4 | 33001303230101212 |
5 | 231021413032040 |
6 | 11225112123234 |
7 | 1110606415045 |
oct | 170163542146 |
9 | 45576525214 |
10 | 16136455270 |
11 | 6930676751 |
12 | 316409651a |
13 | 16a2121cb0 |
14 | ad113255c |
15 | 64699bdea |
hex | 3c1cec466 |
16136455270 has 16 divisors (see below), whose sum is σ = 31279898160. Its totient is φ = 5958075744.
The previous prime is 16136455249. The next prime is 16136455277. The reversal of 16136455270 is 7255463161.
16136455270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16136455277) 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, 62063160 + ... + 62063419.
It is an arithmetic number, because the mean of its divisors is an integer number (1954993635).
Almost surely, 216136455270 is an apocalyptic number.
16136455270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16136455270 is a deficient number, since it is larger than the sum of its proper divisors (15143442890).
16136455270 is a wasteful number, since it uses less digits than its factorization.
16136455270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124126599.
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 16136455270 in words is "sixteen billion, one hundred thirty-six million, four hundred fifty-five thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •