Base | Representation |
---|---|
bin | 1001001110001011111001… |
… | …1111111011110011111011 |
3 | 1022220022100120020200121002 |
4 | 2103202332133323303323 |
5 | 2312110311112023201 |
6 | 33321534435435215 |
7 | 2064353526205622 |
oct | 223427637736373 |
9 | 38808316220532 |
10 | 10139318861051 |
11 | 325a074190406 |
12 | 1179099455b0b |
13 | 587197883003 |
14 | 270a620d26b9 |
15 | 128b30e6a76b |
hex | 938be7fbcfb |
10139318861051 has 8 divisors (see below), whose sum is σ = 10430633355840. Its totient is φ = 9851153712448.
The previous prime is 10139318860991. The next prime is 10139318861059. The reversal of 10139318861051 is 15016881393101.
It is a happy number.
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 10139318861051 - 238 = 9864440954107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10139318860987 and 10139318861005.
It is not an unprimeable number, because it can be changed into a prime (10139318861059) 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, 787330016 + ... + 787342893.
It is an arithmetic number, because the mean of its divisors is an integer number (1303829169480).
Almost surely, 210139318861051 is an apocalyptic number.
10139318861051 is a deficient number, since it is larger than the sum of its proper divisors (291314494789).
10139318861051 is a wasteful number, since it uses less digits than its factorization.
10139318861051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1574673093.
The product of its (nonzero) digits is 155520, while the sum is 47.
The spelling of 10139318861051 in words is "ten trillion, one hundred thirty-nine billion, three hundred eighteen million, eight hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •