Base | Representation |
---|---|
bin | 1001100011001111011101… |
… | …1010110001001100111011 |
3 | 1101011220001022012101202222 |
4 | 2120303313122301030323 |
5 | 2334022123032423201 |
6 | 34200041040114255 |
7 | 2132450556161615 |
oct | 230636732611473 |
9 | 41156038171688 |
10 | 10501051061051 |
11 | 338951a620211 |
12 | 121721090598b |
13 | 5b2324c807c5 |
14 | 284379b91db5 |
15 | 133252e9191b |
hex | 98cf76b133b |
10501051061051 has 16 divisors (see below), whose sum is σ = 11415129707520. Its totient is φ = 9633403010880.
The previous prime is 10501051061041. The next prime is 10501051061077. The reversal of 10501051061051 is 15016015010501.
It is a cyclic number.
It is not a de Polignac number, because 10501051061051 - 26 = 10501051060987 is a prime.
It is a super-2 number, since 2×105010510610512 (a number of 27 digits) contains 22 as substring.
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 10501051061051.
It is not an unprimeable number, because it can be changed into a prime (10501051061021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94315475 + ... + 94426748.
It is an arithmetic number, because the mean of its divisors is an integer number (713445606720).
Almost surely, 210501051061051 is an apocalyptic number.
10501051061051 is a deficient number, since it is larger than the sum of its proper divisors (914078646469).
10501051061051 is a wasteful number, since it uses less digits than its factorization.
10501051061051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188742346.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 10501051061051 its reverse (15016015010501), we get a palindrome (25517066071552).
The spelling of 10501051061051 in words is "ten trillion, five hundred one billion, fifty-one million, sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •