Base | Representation |
---|---|
bin | 110010000101101111001… |
… | …111000001001100001111 |
3 | 110012001202022022000222001 |
4 | 302011233033001030033 |
5 | 422343443030341421 |
6 | 11153143415133131 |
7 | 503454212565025 |
oct | 62055717011417 |
9 | 13161668260861 |
10 | 3442135012111 |
11 | 110788a529334 |
12 | 4771380741a7 |
13 | 1bc790649a73 |
14 | bc859028715 |
15 | 5e8102a5691 |
hex | 3216f3c130f |
3442135012111 has 8 divisors (see below), whose sum is σ = 3535833279600. Its totient is φ = 3348471881088.
The previous prime is 3442135012087. The next prime is 3442135012163. The reversal of 3442135012111 is 1112105312443.
3442135012111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3442135012111 - 27 = 3442135011983 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3442135012111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3442135012171) 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, 8585461 + ... + 8977438.
It is an arithmetic number, because the mean of its divisors is an integer number (441979159950).
Almost surely, 23442135012111 is an apocalyptic number.
3442135012111 is a deficient number, since it is larger than the sum of its proper divisors (93698267489).
3442135012111 is a wasteful number, since it uses less digits than its factorization.
3442135012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17568233.
The product of its (nonzero) digits is 2880, while the sum is 28.
The spelling of 3442135012111 in words is "three trillion, four hundred forty-two billion, one hundred thirty-five million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •