Base | Representation |
---|---|
bin | 11010001100010010… |
… | …10111110001001101 |
3 | 1100021222200121101112 |
4 | 31012021113301031 |
5 | 212244302414121 |
6 | 10243200221405 |
7 | 1005315006341 |
oct | 150611276115 |
9 | 40258617345 |
10 | 14061763661 |
11 | 5a66554190 |
12 | 288530a865 |
13 | 143135581a |
14 | 975793621 |
15 | 57478375b |
hex | 346257c4d |
14061763661 has 8 divisors (see below), whose sum is σ = 15405945984. Its totient is φ = 12728554720.
The previous prime is 14061763633. The next prime is 14061763663. The reversal of 14061763661 is 16636716041.
14061763661 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 14061763661 - 214 = 14061747277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14061763663) 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, 2740661 + ... + 2745786.
It is an arithmetic number, because the mean of its divisors is an integer number (1925743248).
Almost surely, 214061763661 is an apocalyptic number.
14061763661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14061763661 is a deficient number, since it is larger than the sum of its proper divisors (1344182323).
14061763661 is a wasteful number, since it uses less digits than its factorization.
14061763661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5486691.
The product of its (nonzero) digits is 108864, while the sum is 41.
The spelling of 14061763661 in words is "fourteen billion, sixty-one million, seven hundred sixty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •