Base | Representation |
---|---|
bin | 11111111000011000100100… |
… | …110100001101001010100011 |
3 | 200101110100011002211001222212 |
4 | 133320120210310031022203 |
5 | 121334232004210313103 |
6 | 1214113251045552335 |
7 | 41351064414245135 |
oct | 3770304464151243 |
9 | 611410132731885 |
10 | 140214120010403 |
11 | 4074952440a22a |
12 | 138865291156ab |
13 | 603119a16a2ca |
14 | 268a5847a5055 |
15 | 113245739c7d8 |
hex | 7f8624d0d2a3 |
140214120010403 has 4 divisors (see below), whose sum is σ = 140214417787080. Its totient is φ = 140213822233728.
The previous prime is 140214120010333. The next prime is 140214120010417. The reversal of 140214120010403 is 304010021412041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140214120010403 - 224 = 140214103233187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140214120210403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148180913 + ... + 149124146.
It is an arithmetic number, because the mean of its divisors is an integer number (35053604446770).
Almost surely, 2140214120010403 is an apocalyptic number.
140214120010403 is a deficient number, since it is larger than the sum of its proper divisors (297776677).
140214120010403 is an equidigital number, since it uses as much as digits as its factorization.
140214120010403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297776676.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 140214120010403 its reverse (304010021412041), we get a palindrome (444224141422444).
The spelling of 140214120010403 in words is "one hundred forty trillion, two hundred fourteen billion, one hundred twenty million, ten thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •