Base | Representation |
---|---|
bin | 1001001110010000010110… |
… | …0001000110101011100011 |
3 | 1022220102102121020121020022 |
4 | 2103210011201012223203 |
5 | 2312120231122200201 |
6 | 33322253001304055 |
7 | 2064425204535524 |
oct | 223440541065343 |
9 | 38812377217208 |
10 | 10140510350051 |
11 | 325a625803764 |
12 | 117937049502b |
13 | 5873276875a3 |
14 | 270b3644884b |
15 | 128ba087441b |
hex | 93905846ae3 |
10140510350051 has 16 divisors (see below), whose sum is σ = 10387195846560. Its totient is φ = 9896493108480.
The previous prime is 10140510350011. The next prime is 10140510350141. The reversal of 10140510350051 is 15005301504101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140510350051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10140510350051.
It is not an unprimeable number, because it can be changed into a prime (10140510350011) 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 15 ways as a sum of consecutive naturals, for example, 16385120 + ... + 16992738.
It is an arithmetic number, because the mean of its divisors is an integer number (649199740410).
Almost surely, 210140510350051 is an apocalyptic number.
10140510350051 is a deficient number, since it is larger than the sum of its proper divisors (246685496509).
10140510350051 is a wasteful number, since it uses less digits than its factorization.
10140510350051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609814.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 10140510350051 its reverse (15005301504101), we get a palindrome (25145811854152).
The spelling of 10140510350051 in words is "ten trillion, one hundred forty billion, five hundred ten million, three hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •