Base | Representation |
---|---|
bin | 1100011101010111001… |
… | …0100111011100111000 |
3 | 202110110211102102100120 |
4 | 3013111302213130320 |
5 | 12001323243311204 |
6 | 242155000333240 |
7 | 21315054536331 |
oct | 3072562473470 |
9 | 673424372316 |
10 | 214040213304 |
11 | 82857136275 |
12 | 35595774220 |
13 | 1725106a9b8 |
14 | a506a65288 |
15 | 587ad9c6d9 |
hex | 31d5ca7738 |
214040213304 has 16 divisors (see below), whose sum is σ = 535100533320. Its totient is φ = 71346737760.
The previous prime is 214040213293. The next prime is 214040213389. The reversal of 214040213304 is 403312040412.
It is a super-2 number, since 2×2140402133042 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 8918342221 = 214040213304 / (2 + 1 + 4 + 0 + 4 + 0 + 2 + 1 + 3 + 3 + 0 + 4).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4459171087 + ... + 4459171134.
Almost surely, 2214040213304 is an apocalyptic number.
214040213304 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
214040213304 is an abundant number, since it is smaller than the sum of its proper divisors (321060320016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214040213304 is a wasteful number, since it uses less digits than its factorization.
214040213304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8918342230 (or 8918342226 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 214040213304 its reverse (403312040412), we get a palindrome (617352253716).
The spelling of 214040213304 in words is "two hundred fourteen billion, forty million, two hundred thirteen thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •