Base | Representation |
---|---|
bin | 10001101010101000000… |
… | …110110101001010110011 |
3 | 11022001112211022201220010 |
4 | 101222220012311022303 |
5 | 124342233242443103 |
6 | 2325412053350003 |
7 | 153465036301242 |
oct | 21525006651263 |
9 | 4261484281803 |
10 | 1214001140403 |
11 | 428944aa4107 |
12 | 177346638303 |
13 | 8a63120597c |
14 | 42a87c1a959 |
15 | 218a3e96903 |
hex | 11aa81b52b3 |
1214001140403 has 8 divisors (see below), whose sum is σ = 1619998239888. Its totient is φ = 808669067264.
The previous prime is 1214001140399. The next prime is 1214001140419. The reversal of 1214001140403 is 3040411004121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1214001140403 - 22 = 1214001140399 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1214001140403.
It is not an unprimeable number, because it can be changed into a prime (1214201140403) 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 7 ways as a sum of consecutive naturals, for example, 166252326 + ... + 166259627.
It is an arithmetic number, because the mean of its divisors is an integer number (202499779986).
Almost surely, 21214001140403 is an apocalyptic number.
1214001140403 is a deficient number, since it is larger than the sum of its proper divisors (405997099485).
1214001140403 is a wasteful number, since it uses less digits than its factorization.
1214001140403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332513173.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1214001140403 its reverse (3040411004121), we get a palindrome (4254412144524).
The spelling of 1214001140403 in words is "one trillion, two hundred fourteen billion, one million, one hundred forty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •