Base | Representation |
---|---|
bin | 11111110101111000101010… |
… | …010101110011101111011011 |
3 | 200100211220221121200122221111 |
4 | 133311320222111303233123 |
5 | 121323423330441412103 |
6 | 1213502332530321151 |
7 | 41332505366326606 |
oct | 3765705225635733 |
9 | 610756847618844 |
10 | 140042414013403 |
11 | 406927218a3290 |
12 | 138591a91291b7 |
13 | 601ac34947155 |
14 | 268213632533d |
15 | 112cc57db686d |
hex | 7f5e2a573bdb |
140042414013403 has 16 divisors (see below), whose sum is σ = 153440711424000. Its totient is φ = 126755393244480.
The previous prime is 140042414013379. The next prime is 140042414013419. The reversal of 140042414013403 is 304310414240041.
It is not a de Polignac number, because 140042414013403 - 213 = 140042414005211 is a prime.
It is a super-2 number, since 2×1400424140134032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140042414013493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32302678 + ... + 36380596.
It is an arithmetic number, because the mean of its divisors is an integer number (9590044464000).
Almost surely, 2140042414013403 is an apocalyptic number.
140042414013403 is a deficient number, since it is larger than the sum of its proper divisors (13398297410597).
140042414013403 is a wasteful number, since it uses less digits than its factorization.
140042414013403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4091562.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 140042414013403 its reverse (304310414240041), we get a palindrome (444352828253444).
The spelling of 140042414013403 in words is "one hundred forty trillion, forty-two billion, four hundred fourteen million, thirteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •