Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …101011111001101001101011 |
3 | 200101110020112210120012210001 |
4 | 133320113220223321221223 |
5 | 121334222422431402423 |
6 | 1214113003011403431 |
7 | 41351030414432035 |
oct | 3770275053715153 |
9 | 611406483505701 |
10 | 140213111200363 |
11 | 40749056a19323 |
12 | 138862a72b3577 |
13 | 60310691670a6 |
14 | 268a4ca802c55 |
15 | 11323e8a2acad |
hex | 7f85e8af9a6b |
140213111200363 has 2 divisors, whose sum is σ = 140213111200364. Its totient is φ = 140213111200362.
The previous prime is 140213111200321. The next prime is 140213111200403. The reversal of 140213111200363 is 363002111312041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140213111200363 - 213 = 140213111192171 is a prime.
It is not a weakly prime, because it can be changed into another prime (140213111200313) 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 as a sum of consecutive naturals, namely, 70106555600181 + 70106555600182.
It is an arithmetic number, because the mean of its divisors is an integer number (70106555600182).
Almost surely, 2140213111200363 is an apocalyptic number.
140213111200363 is a deficient number, since it is larger than the sum of its proper divisors (1).
140213111200363 is an equidigital number, since it uses as much as digits as its factorization.
140213111200363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 140213111200363 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred eleven million, two hundred thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •