Base | Representation |
---|---|
bin | 1001111010010100110… |
… | …11000011001000101101 |
3 | 1012120000120211100002112 |
4 | 10331022123003020231 |
5 | 21034422030133401 |
6 | 420240314133405 |
7 | 33414112626554 |
oct | 4751233031055 |
9 | 1176016740075 |
10 | 340551021101 |
11 | 12147719a685 |
12 | 56001a21265 |
13 | 261630bb355 |
14 | 126a8986d9b |
15 | 8cd273b3bb |
hex | 4f4a6c322d |
340551021101 has 4 divisors (see below), whose sum is σ = 344861793600. Its totient is φ = 336240248604.
The previous prime is 340551021089. The next prime is 340551021121. The reversal of 340551021101 is 101120155043.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 340551021101 - 26 = 340551021037 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 (340551021121) 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 3 ways as a sum of consecutive naturals, for example, 2155386131 + ... + 2155386288.
It is an arithmetic number, because the mean of its divisors is an integer number (86215448400).
Almost surely, 2340551021101 is an apocalyptic number.
It is an amenable number.
340551021101 is a deficient number, since it is larger than the sum of its proper divisors (4310772499).
340551021101 is an equidigital number, since it uses as much as digits as its factorization.
340551021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4310772498.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 340551021101 its reverse (101120155043), we get a palindrome (441671176144).
The spelling of 340551021101 in words is "three hundred forty billion, five hundred fifty-one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •