Base | Representation |
---|---|
bin | 1100110001001111000111… |
… | …1001000110101100100110 |
3 | 1211201012201112102202220010 |
4 | 3030103301321012230212 |
5 | 3320012420404331042 |
6 | 45505520414151050 |
7 | 2646233366560314 |
oct | 314236171065446 |
9 | 54635645382803 |
10 | 14040011402022 |
11 | 4523376461191 |
12 | 16a906b4b2486 |
13 | 7aac76499268 |
14 | 36777c3670b4 |
15 | 19532d8d859c |
hex | cc4f1e46b26 |
14040011402022 has 16 divisors (see below), whose sum is σ = 28158240142080. Its totient is φ = 4666967577672.
The previous prime is 14040011402017. The next prime is 14040011402047. The reversal of 14040011402022 is 22020411004041.
14040011402022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×140400114020222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14040011402022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3259053418 + ... + 3259057725.
It is an arithmetic number, because the mean of its divisors is an integer number (1759890008880).
Almost surely, 214040011402022 is an apocalyptic number.
14040011402022 is an abundant number, since it is smaller than the sum of its proper divisors (14118228740058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14040011402022 is a wasteful number, since it uses less digits than its factorization.
14040011402022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6518111507.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 14040011402022 its reverse (22020411004041), we get a palindrome (36060422406063).
The spelling of 14040011402022 in words is "fourteen trillion, forty billion, eleven million, four hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •