Base | Representation |
---|---|
bin | 1001111001011001110… |
… | …11001101011010000101 |
3 | 1012111202002121112101211 |
4 | 10330230323031122011 |
5 | 21032413332312201 |
6 | 420115235051421 |
7 | 33365623313041 |
oct | 4745473153205 |
9 | 1174662545354 |
10 | 340056135301 |
11 | 121242906653 |
12 | 55aa4140b71 |
13 | 260b470700c |
14 | 1265cd63021 |
15 | 8ca4083651 |
hex | 4f2cecd685 |
340056135301 has 4 divisors (see below), whose sum is σ = 340140083104. Its totient is φ = 339972187500.
The previous prime is 340056135277. The next prime is 340056135337. The reversal of 340056135301 is 103531650043.
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, and also an emirpimes, since its reverse is a distinct semiprime: 103531650043 = 13337 ⋅7762739.
It is a cyclic number.
It is not a de Polignac number, because 340056135301 - 25 = 340056135269 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 (340056135401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41967825 + ... + 41975926.
It is an arithmetic number, because the mean of its divisors is an integer number (85035020776).
Almost surely, 2340056135301 is an apocalyptic number.
It is an amenable number.
340056135301 is a deficient number, since it is larger than the sum of its proper divisors (83947803).
340056135301 is an equidigital number, since it uses as much as digits as its factorization.
340056135301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83947802.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 340056135301 its reverse (103531650043), we get a palindrome (443587785344).
The spelling of 340056135301 in words is "three hundred forty billion, fifty-six million, one hundred thirty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •