Base | Representation |
---|---|
bin | 1001111011001010100… |
… | …00110001001110000111 |
3 | 1012121011222010102212022 |
4 | 10331211100301032013 |
5 | 21041332313423421 |
6 | 420353121313355 |
7 | 33431221214456 |
oct | 4754520611607 |
9 | 1177158112768 |
10 | 341001311111 |
11 | 12168839418a |
12 | 5610879585b |
13 | 2620548a046 |
14 | 1270c6bcb9d |
15 | 8d0c0357ab |
hex | 4f65431387 |
341001311111 has 8 divisors (see below), whose sum is σ = 341192234160. Its totient is φ = 340810443072.
The previous prime is 341001311093. The next prime is 341001311117. The reversal of 341001311111 is 111113100143.
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 341001311111 - 218 = 341001048967 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 341001311111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (341001311117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19031825 + ... + 19049733.
It is an arithmetic number, because the mean of its divisors is an integer number (42649029270).
Almost surely, 2341001311111 is an apocalyptic number.
341001311111 is a deficient number, since it is larger than the sum of its proper divisors (190923049).
341001311111 is a wasteful number, since it uses less digits than its factorization.
341001311111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27505.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 341001311111 its reverse (111113100143), we get a palindrome (452114411254).
The spelling of 341001311111 in words is "three hundred forty-one billion, one million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •