Base | Representation |
---|---|
bin | 11111111001101000101010… |
… | …011001111011001111000001 |
3 | 200101202120010010001012010100 |
4 | 133321220222121323033001 |
5 | 121342134112430133213 |
6 | 1214220552052553013 |
7 | 41360230410561654 |
oct | 3771505231731701 |
9 | 611676103035110 |
10 | 140300113130433 |
11 | 40781a42278073 |
12 | 1389b128022769 |
13 | 6039322acc499 |
14 | 26907c147b89b |
15 | 11347dba95773 |
hex | 7f9a2a67b3c1 |
140300113130433 has 24 divisors (see below), whose sum is σ = 202778233312928. Its totient is φ = 93476868089472.
The previous prime is 140300113130407. The next prime is 140300113130467. The reversal of 140300113130433 is 334031311003041.
140300113130433 is a `hidden beast` number, since 1 + 4 + 0 + 300 + 1 + 1 + 313 + 0 + 43 + 3 = 666.
It is not a de Polignac number, because 140300113130433 - 26 = 140300113130369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140300113130397 and 140300113130406.
It is not an unprimeable number, because it can be changed into a prime (140300113530433) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 411601410 + ... + 411942132.
Almost surely, 2140300113130433 is an apocalyptic number.
It is an amenable number.
140300113130433 is a deficient number, since it is larger than the sum of its proper divisors (62478120182495).
140300113130433 is a wasteful number, since it uses less digits than its factorization.
140300113130433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368253 (or 368250 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 140300113130433 its reverse (334031311003041), we get a palindrome (474331424133474).
The spelling of 140300113130433 in words is "one hundred forty trillion, three hundred billion, one hundred thirteen million, one hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •