Base | Representation |
---|---|
bin | 1001001110010000110000… |
… | …0101000101011001000101 |
3 | 1022220102201021102000110101 |
4 | 2103210030011011121011 |
5 | 2312120442313222003 |
6 | 33322311533124101 |
7 | 2064431012405014 |
oct | 223441405053105 |
9 | 38812637360411 |
10 | 10140620445253 |
11 | 325a68196a931 |
12 | 11793a1329631 |
13 | 58734442408c |
14 | 270b46d06a7b |
15 | 128baa37011d |
hex | 9390c145645 |
10140620445253 has 4 divisors (see below), whose sum is σ = 10291972989280. Its totient is φ = 9989267901228.
The previous prime is 10140620445229. The next prime is 10140620445311. The reversal of 10140620445253 is 35254402604101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140620445253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140620445223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75676271913 + ... + 75676272046.
It is an arithmetic number, because the mean of its divisors is an integer number (2572993247320).
Almost surely, 210140620445253 is an apocalyptic number.
It is an amenable number.
10140620445253 is a deficient number, since it is larger than the sum of its proper divisors (151352544027).
10140620445253 is an equidigital number, since it uses as much as digits as its factorization.
10140620445253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151352544026.
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 10140620445253 in words is "ten trillion, one hundred forty billion, six hundred twenty million, four hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •