Base | Representation |
---|---|
bin | 1100011110011110110… |
… | …0111111111001001000 |
3 | 202111020202220021100212 |
4 | 3013213230333321020 |
5 | 12002432211333230 |
6 | 242244453420252 |
7 | 21325364101514 |
oct | 3074754777110 |
9 | 674222807325 |
10 | 214340730440 |
11 | 829a0833241 |
12 | 3565a33a688 |
13 | 1729b3b9ca5 |
14 | a534931144 |
15 | 589745e895 |
hex | 31e7b3fe48 |
214340730440 has 16 divisors (see below), whose sum is σ = 482266643580. Its totient is φ = 85736292160.
The previous prime is 214340730433. The next prime is 214340730467. The reversal of 214340730440 is 44037043412.
It can be written as a sum of positive squares in 2 ways, for example, as 203117870596 + 11222859844 = 450686^2 + 105938^2 .
It is a junction number, because it is equal to n+sod(n) for n = 214340730397 and 214340730406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2679259091 + ... + 2679259170.
Almost surely, 2214340730440 is an apocalyptic number.
214340730440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
214340730440 is an abundant number, since it is smaller than the sum of its proper divisors (267925913140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214340730440 is a wasteful number, since it uses less digits than its factorization.
214340730440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5358518272 (or 5358518268 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 32.
Adding to 214340730440 its reverse (44037043412), we get a palindrome (258377773852).
The spelling of 214340730440 in words is "two hundred fourteen billion, three hundred forty million, seven hundred thirty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •