Base | Representation |
---|---|
bin | 11111110101100110111001… |
… | …100001101011100101010011 |
3 | 200100210002201102021002122012 |
4 | 133311212321201223211103 |
5 | 121323120300401243443 |
6 | 1213445500210533135 |
7 | 41331231635133503 |
oct | 3765467141534523 |
9 | 610702642232565 |
10 | 140023341431123 |
11 | 40685624922997 |
12 | 138555658971ab |
13 | 60191b54456c7 |
14 | 2681247295a03 |
15 | 112c4dd791118 |
hex | 7f59b986b953 |
140023341431123 has 2 divisors, whose sum is σ = 140023341431124. Its totient is φ = 140023341431122.
The previous prime is 140023341431089. The next prime is 140023341431137. The reversal of 140023341431123 is 321134143320041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140023341431123 - 26 = 140023341431059 is a prime.
It is a super-2 number, since 2×1400233414311232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140023341431123.
It is not a weakly prime, because it can be changed into another prime (140023341431143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70011670715561 + 70011670715562.
It is an arithmetic number, because the mean of its divisors is an integer number (70011670715562).
Almost surely, 2140023341431123 is an apocalyptic number.
140023341431123 is a deficient number, since it is larger than the sum of its proper divisors (1).
140023341431123 is an equidigital number, since it uses as much as digits as its factorization.
140023341431123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 140023341431123 its reverse (321134143320041), we get a palindrome (461157484751164).
The spelling of 140023341431123 in words is "one hundred forty trillion, twenty-three billion, three hundred forty-one million, four hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •