Base | Representation |
---|---|
bin | 1111100000110001000110… |
… | …01101100000111011010101 |
3 | 11110210000000122100011210212 |
4 | 13300120203031200323111 |
5 | 13432334240034311013 |
6 | 200314251213255205 |
7 | 10120311566365151 |
oct | 760304315407325 |
9 | 143700018304725 |
10 | 34111221010133 |
11 | a96153aa89813 |
12 | 39aab96a94505 |
13 | 160589c6a4187 |
14 | 85cdc5b0c061 |
15 | 3e24a01676a8 |
hex | 1f0623360ed5 |
34111221010133 has 8 divisors (see below), whose sum is σ = 34451684467200. Its totient is φ = 33770936140848.
The previous prime is 34111221010123. The next prime is 34111221010259. The reversal of 34111221010133 is 33101012211143.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 34111221010133 - 210 = 34111221009109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34111221010099 and 34111221010108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34111221010123) 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, 44263013 + ... + 45027066.
It is an arithmetic number, because the mean of its divisors is an integer number (4306460558400).
Almost surely, 234111221010133 is an apocalyptic number.
It is an amenable number.
34111221010133 is a deficient number, since it is larger than the sum of its proper divisors (340463457067).
34111221010133 is a wasteful number, since it uses less digits than its factorization.
34111221010133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89293891.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 34111221010133 its reverse (33101012211143), we get a palindrome (67212233221276).
The spelling of 34111221010133 in words is "thirty-four trillion, one hundred eleven billion, two hundred twenty-one million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •