Base | Representation |
---|---|
bin | 11011001101110001… |
… | …01011001110001101 |
3 | 1101201021020111001020 |
4 | 31212320223032031 |
5 | 214410411110041 |
6 | 10413501104353 |
7 | 1025034514512 |
oct | 154670531615 |
9 | 41637214036 |
10 | 14611035021 |
11 | 6218603960 |
12 | 29b92580b9 |
13 | 14bb09c46b |
14 | 9c86d3309 |
15 | 5a7ad0866 |
hex | 366e2b38d |
14611035021 has 16 divisors (see below), whose sum is σ = 21287923200. Its totient is φ = 8840377520.
The previous prime is 14611034989. The next prime is 14611035073. The reversal of 14611035021 is 12053011641.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 14611035021 - 25 = 14611034989 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14611034982 and 14611035000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14611034021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 349815 + ... + 389348.
It is an arithmetic number, because the mean of its divisors is an integer number (1330495200).
Almost surely, 214611035021 is an apocalyptic number.
14611035021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14611035021 is a deficient number, since it is larger than the sum of its proper divisors (6676888179).
14611035021 is a wasteful number, since it uses less digits than its factorization.
14611035021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739776.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 14611035021 its reverse (12053011641), we get a palindrome (26664046662).
The spelling of 14611035021 in words is "fourteen billion, six hundred eleven million, thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •