Base | Representation |
---|---|
bin | 11010010010010010… |
… | …00101111110001110 |
3 | 1100102111021000102211 |
4 | 31021021011332032 |
5 | 212400134204124 |
6 | 10252153341034 |
7 | 1006465132330 |
oct | 151111057616 |
9 | 40374230384 |
10 | 14112022414 |
11 | 5a91961346 |
12 | 289a10777a |
13 | 143b8a1929 |
14 | 97c317450 |
15 | 578daee94 |
hex | 349245f8e |
14112022414 has 8 divisors (see below), whose sum is σ = 24192038448. Its totient is φ = 6048009600.
The previous prime is 14112022403. The next prime is 14112022487. The reversal of 14112022414 is 41422021141.
14112022414 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×141120224142 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 504000787 + ... + 504000814.
It is an arithmetic number, because the mean of its divisors is an integer number (3024004806).
Almost surely, 214112022414 is an apocalyptic number.
14112022414 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
14112022414 is a deficient number, since it is larger than the sum of its proper divisors (10080016034).
14112022414 is a wasteful number, since it uses less digits than its factorization.
14112022414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008001610.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 14112022414 its reverse (41422021141), we get a palindrome (55534043555).
The spelling of 14112022414 in words is "fourteen billion, one hundred twelve million, twenty-two thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •