Base | Representation |
---|---|
bin | 1000001011011010011… |
… | …0001101111000001111 |
3 | 111102122212002201102100 |
4 | 2002312212031320033 |
5 | 4300222110100403 |
6 | 144313530330143 |
7 | 13102531623345 |
oct | 2026646157017 |
9 | 442585081370 |
10 | 140502425103 |
11 | 5464aa575a7 |
12 | 23291b89953 |
13 | 103319b5b61 |
14 | 6b2c255995 |
15 | 39c4db82a3 |
hex | 20b698de0f |
140502425103 has 12 divisors (see below), whose sum is σ = 202961973240. Its totient is φ = 93661809936.
The previous prime is 140502425087. The next prime is 140502425111. The reversal of 140502425103 is 301524205041.
140502425103 is a `hidden beast` number, since 1 + 405 + 0 + 2 + 4 + 251 + 0 + 3 = 666.
140502425103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140502425103 - 24 = 140502425087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140502425143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 400101 + ... + 664142.
It is an arithmetic number, because the mean of its divisors is an integer number (16913497770).
Almost surely, 2140502425103 is an apocalyptic number.
140502425103 is a deficient number, since it is larger than the sum of its proper divisors (62459548137).
140502425103 is a wasteful number, since it uses less digits than its factorization.
140502425103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078918 (or 1078915 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 140502425103 in words is "one hundred forty billion, five hundred two million, four hundred twenty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •