Base | Representation |
---|---|
bin | 1111100010001100001001… |
… | …11111110011100110010101 |
3 | 11110221200012112111100101012 |
4 | 13301012010333303212111 |
5 | 13434134344143132041 |
6 | 200352534113142005 |
7 | 10123662164012501 |
oct | 761060477634625 |
9 | 143850175440335 |
10 | 34160106224021 |
11 | a980246458528 |
12 | 39b855a55a905 |
13 | 160a3904b703b |
14 | 861502371301 |
15 | 3e38b1c053eb |
hex | 1f1184ff3995 |
34160106224021 has 8 divisors (see below), whose sum is σ = 34783631500800. Its totient is φ = 33541358919120.
The previous prime is 34160106223979. The next prime is 34160106224063. The reversal of 34160106224021 is 12042260106143.
It is an interprime number because it is at equal distance from previous prime (34160106223979) and next prime (34160106224063).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34160106224021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34160106224521) 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, 1194478541 + ... + 1194507138.
It is an arithmetic number, because the mean of its divisors is an integer number (4347953937600).
Almost surely, 234160106224021 is an apocalyptic number.
It is an amenable number.
34160106224021 is a deficient number, since it is larger than the sum of its proper divisors (623525276779).
34160106224021 is a wasteful number, since it uses less digits than its factorization.
34160106224021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2388985939.
The product of its (nonzero) digits is 13824, while the sum is 32.
The spelling of 34160106224021 in words is "thirty-four trillion, one hundred sixty billion, one hundred six million, two hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •