Base | Representation |
---|---|
bin | 1000001001111111101… |
… | …1011100000101000001 |
3 | 111101200100110211100202 |
4 | 2002133323130011001 |
5 | 4243432230043241 |
6 | 144212103054545 |
7 | 13060233205622 |
oct | 2023773340501 |
9 | 441610424322 |
10 | 140122112321 |
11 | 54475308a14 |
12 | 231a6741455 |
13 | 102a0c784c9 |
14 | 6ad3937a49 |
15 | 39a17e2d9b |
hex | 209fedc141 |
140122112321 has 2 divisors, whose sum is σ = 140122112322. Its totient is φ = 140122112320.
The previous prime is 140122112303. The next prime is 140122112327. The reversal of 140122112321 is 123211221041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70921548721 + 69200563600 = 266311^2 + 263060^2 .
It is a cyclic number.
It is not a de Polignac number, because 140122112321 - 230 = 139048370497 is a prime.
It is a super-2 number, since 2×1401221123212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140122112293 and 140122112302.
It is not a weakly prime, because it can be changed into another prime (140122112327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70061056160 + 70061056161.
It is an arithmetic number, because the mean of its divisors is an integer number (70061056161).
Almost surely, 2140122112321 is an apocalyptic number.
It is an amenable number.
140122112321 is a deficient number, since it is larger than the sum of its proper divisors (1).
140122112321 is an equidigital number, since it uses as much as digits as its factorization.
140122112321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 140122112321 its reverse (123211221041), we get a palindrome (263333333362).
The spelling of 140122112321 in words is "one hundred forty billion, one hundred twenty-two million, one hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •