Base | Representation |
---|---|
bin | 1001011010011101010000… |
… | …1001110011000000000011 |
3 | 1100122110111202001022101202 |
4 | 2112213110021303000003 |
5 | 2324034034200212201 |
6 | 34002441525051415 |
7 | 2115526002425006 |
oct | 226472411630003 |
9 | 40573452038352 |
10 | 10350135554051 |
11 | 3330516769107 |
12 | 11b1b13556b6b |
13 | 5a1023b38637 |
14 | 27ad409a953d |
15 | 12e36dd20c6b |
hex | 969d4273003 |
10350135554051 has 8 divisors (see below), whose sum is σ = 10930367743680. Its totient is φ = 9773452185768.
The previous prime is 10350135554047. The next prime is 10350135554053. The reversal of 10350135554051 is 15045553105301.
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 10350135554051 - 22 = 10350135554047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10350135553996 and 10350135554014.
It is not an unprimeable number, because it can be changed into a prime (10350135554053) 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, 887199341 + ... + 887211006.
It is an arithmetic number, because the mean of its divisors is an integer number (1366295967960).
Almost surely, 210350135554051 is an apocalyptic number.
10350135554051 is a deficient number, since it is larger than the sum of its proper divisors (580232189629).
10350135554051 is a wasteful number, since it uses less digits than its factorization.
10350135554051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1774410673.
The product of its (nonzero) digits is 112500, while the sum is 38.
Adding to 10350135554051 its reverse (15045553105301), we get a palindrome (25395688659352).
The spelling of 10350135554051 in words is "ten trillion, three hundred fifty billion, one hundred thirty-five million, five hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •