Base | Representation |
---|---|
bin | 111010100001001110000… |
… | …111101100110000000110 |
3 | 112020102221021121212120210 |
4 | 322201032013230300012 |
5 | 1011341311401431324 |
6 | 12315223342540250 |
7 | 563352020156550 |
oct | 72411607546006 |
9 | 15212837555523 |
10 | 4021400030214 |
11 | 1310514530056 |
12 | 54b45a897686 |
13 | 2322a75627c8 |
14 | dc8cb5444d0 |
15 | 6e914ac4d29 |
hex | 3a84e1ecc06 |
4021400030214 has 32 divisors (see below), whose sum is σ = 9347564240640. Its totient is φ = 1129497344352.
The previous prime is 4021400030213. The next prime is 4021400030227. The reversal of 4021400030214 is 4120300041204.
It is a super-2 number, since 2×40214000302142 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021400030213) 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 15 ways as a sum of consecutive naturals, for example, 811418029 + ... + 811422984.
It is an arithmetic number, because the mean of its divisors is an integer number (292111382520).
Almost surely, 24021400030214 is an apocalyptic number.
4021400030214 is an abundant number, since it is smaller than the sum of its proper divisors (5326164210426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4021400030214 is a wasteful number, since it uses less digits than its factorization.
4021400030214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622841084.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 4021400030214 its reverse (4120300041204), we get a palindrome (8141700071418).
The spelling of 4021400030214 in words is "four trillion, twenty-one billion, four hundred million, thirty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •