Base | Representation |
---|---|
bin | 11111111001101000101010… |
… | …011010001111001010000000 |
3 | 200101202120010010012100001112 |
4 | 133321220222122033022000 |
5 | 121342134112440241112 |
6 | 1214220552054422452 |
7 | 41360230411351604 |
oct | 3771505232171200 |
9 | 611676103170045 |
10 | 140300113212032 |
11 | 40781a42323404 |
12 | 1389b128061a28 |
13 | 6039322b2a677 |
14 | 26907c149d504 |
15 | 11347dbaaea22 |
hex | 7f9a2a68f280 |
140300113212032 has 16 divisors (see below), whose sum is σ = 279504131789850. Its totient is φ = 70150056605952.
The previous prime is 140300113212013. The next prime is 140300113212073. The reversal of 140300113212032 is 230212311003041.
It can be written as a sum of positive squares in only one way, i.e., 137517275354176 + 2782837857856 = 11726776^2 + 1668184^2 .
It is a tau number, because it is divible by the number of its divisors (16).
It is a junction number, because it is equal to n+sod(n) for n = 140300113211989 and 140300113212007.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 548047317107 + ... + 548047317362.
Almost surely, 2140300113212032 is an apocalyptic number.
It is an amenable number.
140300113212032 is a deficient number, since it is larger than the sum of its proper divisors (139204018577818).
140300113212032 is an equidigital number, since it uses as much as digits as its factorization.
140300113212032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096094634483 (or 1096094634471 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 140300113212032 its reverse (230212311003041), we get a palindrome (370512424215073).
The spelling of 140300113212032 in words is "one hundred forty trillion, three hundred billion, one hundred thirteen million, two hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •