Base | Representation |
---|---|
bin | 11011010110000100… |
… | …11110101000100011 |
3 | 1101220010100112022101 |
4 | 31223002132220203 |
5 | 220031230320023 |
6 | 10424430351231 |
7 | 1026542002522 |
oct | 155302365043 |
9 | 41803315271 |
10 | 14680713763 |
11 | 62539755a1 |
12 | 2a1865b517 |
13 | 14cc6579a1 |
14 | 9d3a704b9 |
15 | 5adc961ad |
hex | 36b09ea23 |
14680713763 has 8 divisors (see below), whose sum is σ = 14933977200. Its totient is φ = 14427598368.
The previous prime is 14680713737. The next prime is 14680713799. The reversal of 14680713763 is 36731708641.
14680713763 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 a cyclic number.
It is not a de Polignac number, because 14680713763 - 29 = 14680713251 is a prime.
It is a super-2 number, since 2×146807137632 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14680713163) 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, 173233 + ... + 243661.
It is an arithmetic number, because the mean of its divisors is an integer number (1866747150).
Almost surely, 214680713763 is an apocalyptic number.
14680713763 is a deficient number, since it is larger than the sum of its proper divisors (253263437).
14680713763 is an equidigital number, since it uses as much as digits as its factorization.
14680713763 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74021.
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 14680713763 in words is "fourteen billion, six hundred eighty million, seven hundred thirteen thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •