Base | Representation |
---|---|
bin | 11111111000110100011011… |
… | …000011011110011000101011 |
3 | 200101120012022221211100002212 |
4 | 133320310123003132120223 |
5 | 121340224223334341021 |
6 | 1214135114104115335 |
7 | 41353203402463010 |
oct | 3770643303363053 |
9 | 611505287740085 |
10 | 140244021012011 |
11 | 40760178786304 |
12 | 13890292a65b4b |
13 | 6033c53b7c777 |
14 | 268bbbd9dd707 |
15 | 113310746d85b |
hex | 7f8d1b0de62b |
140244021012011 has 8 divisors (see below), whose sum is σ = 167247528163584. Its totient is φ = 114982675612200.
The previous prime is 140244021011971. The next prime is 140244021012041. The reversal of 140244021012011 is 110210120442041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140244021012011 - 214 = 140244020995627 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140244021012041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 435540437765 + ... + 435540438086.
It is an arithmetic number, because the mean of its divisors is an integer number (20905941020448).
Almost surely, 2140244021012011 is an apocalyptic number.
140244021012011 is a deficient number, since it is larger than the sum of its proper divisors (27003507151573).
140244021012011 is an equidigital number, since it uses as much as digits as its factorization.
140244021012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 871080875881.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 140244021012011 its reverse (110210120442041), we get a palindrome (250454141454052).
The spelling of 140244021012011 in words is "one hundred forty trillion, two hundred forty-four billion, twenty-one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •