Base | Representation |
---|---|
bin | 11010010010001000… |
… | …10011111110000101 |
3 | 1100102101220100010011 |
4 | 31021010103332011 |
5 | 212344324102104 |
6 | 10252110430221 |
7 | 1006451362210 |
oct | 151104237605 |
9 | 40371810104 |
10 | 14110769029 |
11 | 5a91185695 |
12 | 2899802371 |
13 | 143b553296 |
14 | 97c0ac777 |
15 | 578c13904 |
hex | 349113f85 |
14110769029 has 8 divisors (see below), whose sum is σ = 17075216448. Its totient is φ = 11383477440.
The previous prime is 14110769021. The next prime is 14110769033. The reversal of 14110769029 is 92096701141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14110769029 - 23 = 14110769021 is a prime.
It is a super-2 number, since 2×141107690292 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14110768982 and 14110769000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14110769021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59288827 + ... + 59289064.
It is an arithmetic number, because the mean of its divisors is an integer number (2134402056).
Almost surely, 214110769029 is an apocalyptic number.
It is an amenable number.
14110769029 is a deficient number, since it is larger than the sum of its proper divisors (2964447419).
14110769029 is a wasteful number, since it uses less digits than its factorization.
14110769029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118577915.
The product of its (nonzero) digits is 27216, while the sum is 40.
The spelling of 14110769029 in words is "fourteen billion, one hundred ten million, seven hundred sixty-nine thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •