Base | Representation |
---|---|
bin | 1000001001111010011… |
… | …1010000001001010111 |
3 | 111101121210221121102111 |
4 | 2002132213100021113 |
5 | 4243411102341401 |
6 | 144205554051451 |
7 | 13056544501612 |
oct | 2023647201127 |
9 | 441553847374 |
10 | 140100043351 |
11 | 544639051a4 |
12 | 2319b279b87 |
13 | 1029951c448 |
14 | 6ad0a31179 |
15 | 399e8d3e51 |
hex | 209e9d0257 |
140100043351 has 2 divisors, whose sum is σ = 140100043352. Its totient is φ = 140100043350.
The previous prime is 140100043331. The next prime is 140100043373. The reversal of 140100043351 is 153340001041.
It is an a-pointer prime, because the next prime (140100043373) can be obtained adding 140100043351 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 140100043351 - 29 = 140100042839 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140100043331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70050021675 + 70050021676.
It is an arithmetic number, because the mean of its divisors is an integer number (70050021676).
Almost surely, 2140100043351 is an apocalyptic number.
140100043351 is a deficient number, since it is larger than the sum of its proper divisors (1).
140100043351 is an equidigital number, since it uses as much as digits as its factorization.
140100043351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 140100043351 its reverse (153340001041), we get a palindrome (293440044392).
The spelling of 140100043351 in words is "one hundred forty billion, one hundred million, forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •