Base | Representation |
---|---|
bin | 1100110000001001110010… |
… | …0101011001000110111011 |
3 | 1211122102200111100221020201 |
4 | 3030002130211121012323 |
5 | 3314211311434131021 |
6 | 45453201541503031 |
7 | 2645004241045444 |
oct | 314023445310673 |
9 | 54572614327221 |
10 | 14021400302011 |
11 | 4516495a2a2a3 |
12 | 16a5536711a77 |
13 | 7a929b78494b |
14 | 3668d47042cb |
15 | 194adea6d591 |
hex | cc09c9591bb |
14021400302011 has 4 divisors (see below), whose sum is σ = 14021409360024. Its totient is φ = 14021391244000.
The previous prime is 14021400301963. The next prime is 14021400302017. The reversal of 14021400302011 is 11020300412041.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 14021400302011 - 237 = 13883961348539 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14021400302011.
It is not an unprimeable number, because it can be changed into a prime (14021400302017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1556965 + ... + 5519686.
It is an arithmetic number, because the mean of its divisors is an integer number (3505352340006).
Almost surely, 214021400302011 is an apocalyptic number.
14021400302011 is a deficient number, since it is larger than the sum of its proper divisors (9058013).
14021400302011 is an equidigital number, since it uses as much as digits as its factorization.
14021400302011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9058012.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 14021400302011 its reverse (11020300412041), we get a palindrome (25041700714052).
The spelling of 14021400302011 in words is "fourteen trillion, twenty-one billion, four hundred million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •