Base | Representation |
---|---|
bin | 11010010010011001… |
… | …11000100100000111 |
3 | 1100102120010111110221 |
4 | 31021030320210013 |
5 | 212400413003241 |
6 | 10252230525211 |
7 | 1006506441310 |
oct | 151114704407 |
9 | 40376114427 |
10 | 14113016071 |
11 | 5a9247a950 |
12 | 289a506807 |
13 | 143bb5bcab |
14 | 97c4d5607 |
15 | 5790095d1 |
hex | 349338907 |
14113016071 has 8 divisors (see below), whose sum is σ = 17595448704. Its totient is φ = 10997155320.
The previous prime is 14113016053. The next prime is 14113016081. The reversal of 14113016071 is 17061031141.
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 14113016071 - 215 = 14112983303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14113016081) 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, 91642885 + ... + 91643038.
It is an arithmetic number, because the mean of its divisors is an integer number (2199431088).
Almost surely, 214113016071 is an apocalyptic number.
14113016071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14113016071 is a deficient number, since it is larger than the sum of its proper divisors (3482432633).
14113016071 is a wasteful number, since it uses less digits than its factorization.
14113016071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183285941.
The product of its (nonzero) digits is 504, while the sum is 25.
The spelling of 14113016071 in words is "fourteen billion, one hundred thirteen million, sixteen thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •