Base | Representation |
---|---|
bin | 1000001011011101000… |
… | …1100110111110010001 |
3 | 111102200122111121221211 |
4 | 2002313101212332101 |
5 | 4300233013100311 |
6 | 144315014220121 |
7 | 13103030410504 |
oct | 2026721467621 |
9 | 442618447854 |
10 | 140513800081 |
11 | 54656416806 |
12 | 23295954641 |
13 | 10334169505 |
14 | 6b2d97713b |
15 | 39c5db3821 |
hex | 20b7466f91 |
140513800081 has 2 divisors, whose sum is σ = 140513800082. Its totient is φ = 140513800080.
The previous prime is 140513800061. The next prime is 140513800159. The reversal of 140513800081 is 180008315041.
140513800081 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 can be written as a sum of positive squares in only one way, i.e., 71457843856 + 69055956225 = 267316^2 + 262785^2 .
It is a cyclic number.
It is not a de Polignac number, because 140513800081 - 225 = 140480245649 is a prime.
It is a super-2 number, since 2×1405138000812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140513800061) 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, 70256900040 + 70256900041.
It is an arithmetic number, because the mean of its divisors is an integer number (70256900041).
Almost surely, 2140513800081 is an apocalyptic number.
It is an amenable number.
140513800081 is a deficient number, since it is larger than the sum of its proper divisors (1).
140513800081 is an equidigital number, since it uses as much as digits as its factorization.
140513800081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 31.
The spelling of 140513800081 in words is "one hundred forty billion, five hundred thirteen million, eight hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •