Base | Representation |
---|---|
bin | 1000001010011010010… |
… | …0011001001100010101 |
3 | 111101222010002111120201 |
4 | 2002212210121030111 |
5 | 4244144234333301 |
6 | 144231122500501 |
7 | 13063055116303 |
oct | 2024644311425 |
9 | 441863074521 |
10 | 140233511701 |
11 | 54522185a18 |
12 | 23217b04731 |
13 | 102bb0807ba |
14 | 6b04655273 |
15 | 39ab49a201 |
hex | 20a6919315 |
140233511701 has 2 divisors, whose sum is σ = 140233511702. Its totient is φ = 140233511700.
The previous prime is 140233511699. The next prime is 140233511731. The reversal of 140233511701 is 107115332041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77367978801 + 62865532900 = 278151^2 + 250730^2 .
It is a cyclic number.
It is not a de Polignac number, because 140233511701 - 21 = 140233511699 is a prime.
Together with 140233511699, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 140233511701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140233511731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70116755850 + 70116755851.
It is an arithmetic number, because the mean of its divisors is an integer number (70116755851).
Almost surely, 2140233511701 is an apocalyptic number.
It is an amenable number.
140233511701 is a deficient number, since it is larger than the sum of its proper divisors (1).
140233511701 is an equidigital number, since it uses as much as digits as its factorization.
140233511701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 140233511701 its reverse (107115332041), we get a palindrome (247348843742).
The spelling of 140233511701 in words is "one hundred forty billion, two hundred thirty-three million, five hundred eleven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •