Base | Representation |
---|---|
bin | 1000001010011001111… |
… | …1011001000010011111 |
3 | 111101222000121212202012 |
4 | 2002212133121002133 |
5 | 4244143420402401 |
6 | 144231034421435 |
7 | 13063041015155 |
oct | 2024637310237 |
9 | 441860555665 |
10 | 140232200351 |
11 | 5452146a761 |
12 | 2321759187b |
13 | 102baa11959 |
14 | 6b043d33d5 |
15 | 39ab2db8bb |
hex | 20a67d909f |
140232200351 has 2 divisors, whose sum is σ = 140232200352. Its totient is φ = 140232200350.
The previous prime is 140232200309. The next prime is 140232200401. The reversal of 140232200351 is 153002232041.
140232200351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (153002232041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140232200351 - 214 = 140232183967 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140232200651) 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 as a sum of consecutive naturals, namely, 70116100175 + 70116100176.
It is an arithmetic number, because the mean of its divisors is an integer number (70116100176).
Almost surely, 2140232200351 is an apocalyptic number.
140232200351 is a deficient number, since it is larger than the sum of its proper divisors (1).
140232200351 is an equidigital number, since it uses as much as digits as its factorization.
140232200351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 140232200351 its reverse (153002232041), we get a palindrome (293234432392).
The spelling of 140232200351 in words is "one hundred forty billion, two hundred thirty-two million, two hundred thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •