Base | Representation |
---|---|
bin | 11111111011101110000110… |
… | …111110010101100010100011 |
3 | 200102021020222000202102110020 |
4 | 133323232012332111202203 |
5 | 121402011040411200003 |
6 | 1214410450214004523 |
7 | 41403462243662640 |
oct | 3773560676254243 |
9 | 612236860672406 |
10 | 140443400100003 |
11 | 40827791006090 |
12 | 13902a56646743 |
13 | 60499a9660790 |
14 | 26976d5452dc7 |
15 | 11383c6143d53 |
hex | 7fbb86f958a3 |
140443400100003 has 64 divisors (see below), whose sum is σ = 257270200061952. Its totient is φ = 65779312394880.
The previous prime is 140443400099983. The next prime is 140443400100013. The reversal of 140443400100003 is 300001004344041.
It is not a de Polignac number, because 140443400100003 - 217 = 140443399968931 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140443400100013) 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 63 ways as a sum of consecutive naturals, for example, 543681325 + ... + 543939582.
It is an arithmetic number, because the mean of its divisors is an integer number (4019846875968).
Almost surely, 2140443400100003 is an apocalyptic number.
140443400100003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140443400100003 is a deficient number, since it is larger than the sum of its proper divisors (116826799961949).
140443400100003 is a wasteful number, since it uses less digits than its factorization.
140443400100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087620984.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 140443400100003 its reverse (300001004344041), we get a palindrome (440444404444044).
The spelling of 140443400100003 in words is "one hundred forty trillion, four hundred forty-three billion, four hundred million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •