Base | Representation |
---|---|
bin | 1100111011010011111011… |
… | …1110010011111011100110 |
3 | 1212022202111121101110202010 |
4 | 3032310332332103323212 |
5 | 3330331413421220142 |
6 | 50121224242255050 |
7 | 2664601643506221 |
oct | 316647676237346 |
9 | 55282447343663 |
10 | 14213103304422 |
11 | 458a81a30a3a0 |
12 | 1716717657486 |
13 | 7c139cb74699 |
14 | 371cbc8ca5b8 |
15 | 199aae8cce9c |
hex | ced3ef93ee6 |
14213103304422 has 16 divisors (see below), whose sum is σ = 31010407209792. Its totient is φ = 4307001001320.
The previous prime is 14213103304417. The next prime is 14213103304423. The reversal of 14213103304422 is 22440330131241.
It is a self number, because there is not a number n which added to its sum of digits gives 14213103304422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14213103304423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107675024968 + ... + 107675025099.
It is an arithmetic number, because the mean of its divisors is an integer number (1938150450612).
Almost surely, 214213103304422 is an apocalyptic number.
14213103304422 is an abundant number, since it is smaller than the sum of its proper divisors (16797303905370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14213103304422 is a wasteful number, since it uses less digits than its factorization.
14213103304422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215350050083.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 14213103304422 its reverse (22440330131241), we get a palindrome (36653433435663).
The spelling of 14213103304422 in words is "fourteen trillion, two hundred thirteen billion, one hundred three million, three hundred four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •