Base | Representation |
---|---|
bin | 1000001011000111000… |
… | …1100001110000001011 |
3 | 111102110012211111112212 |
4 | 2002301301201300023 |
5 | 4300040401112021 |
6 | 144301520055335 |
7 | 13100530042655 |
oct | 2026161416013 |
9 | 442405744485 |
10 | 140421504011 |
11 | 54609307368 |
12 | 2326aa6454b |
13 | 1031acc2459 |
14 | 6b215cd6d5 |
15 | 39bcc3185b |
hex | 20b1c61c0b |
140421504011 has 8 divisors (see below), whose sum is σ = 141743226240. Its totient is φ = 139100390208.
The previous prime is 140421503951. The next prime is 140421504023. The reversal of 140421504011 is 110405124041.
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 140421504011 - 26 = 140421503947 is a prime.
It is a super-2 number, since 2×1404215040112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140421506011) 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, 318470 + ... + 618276.
It is an arithmetic number, because the mean of its divisors is an integer number (17717903280).
Almost surely, 2140421504011 is an apocalyptic number.
140421504011 is a deficient number, since it is larger than the sum of its proper divisors (1321722229).
140421504011 is a wasteful number, since it uses less digits than its factorization.
140421504011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304213.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 140421504011 its reverse (110405124041), we get a palindrome (250826628052).
The spelling of 140421504011 in words is "one hundred forty billion, four hundred twenty-one million, five hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •