Base | Representation |
---|---|
bin | 1111100111011011111111… |
… | …00110000101100000110101 |
3 | 11111120220120210222122000020 |
4 | 13303231333212011200311 |
5 | 14000113121440101010 |
6 | 201011433001035353 |
7 | 10143004141503420 |
oct | 763557746054065 |
9 | 144526523878006 |
10 | 34340404222005 |
11 | aa3a757a26a32 |
12 | 3a27497a85b59 |
13 | 1621394aa804b |
14 | 86a12797c9b7 |
15 | 3e8415674470 |
hex | 1f3b7f985835 |
34340404222005 has 256 divisors, whose sum is σ = 70884363755520. Its totient is φ = 13818826948608.
The previous prime is 34340404221983. The next prime is 34340404222009. The reversal of 34340404222005 is 50022240404343.
It is not a de Polignac number, because 34340404222005 - 212 = 34340404217909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34340404222009) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1063253017 + ... + 1063285313.
It is an arithmetic number, because the mean of its divisors is an integer number (276892045920).
Almost surely, 234340404222005 is an apocalyptic number.
34340404222005 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
34340404222005 is an abundant number, since it is smaller than the sum of its proper divisors (36543959533515).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34340404222005 is a wasteful number, since it uses less digits than its factorization.
34340404222005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32748.
The product of its (nonzero) digits is 92160, while the sum is 33.
Adding to 34340404222005 its reverse (50022240404343), we get a palindrome (84362644626348).
The spelling of 34340404222005 in words is "thirty-four trillion, three hundred forty billion, four hundred four million, two hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •