Base | Representation |
---|---|
bin | 1001011001010110000001… |
… | …0011010001010010010100 |
3 | 1100120122010222201200021021 |
4 | 2112111200103101102110 |
5 | 2323230403033324111 |
6 | 33550000145130524 |
7 | 2114251052123434 |
oct | 226254023212224 |
9 | 40518128650237 |
10 | 10331012011156 |
11 | 33233a2a51301 |
12 | 11aa277029a44 |
13 | 59c296c03495 |
14 | 27a048c722c4 |
15 | 12daeeed0d71 |
hex | 965604d1494 |
10331012011156 has 6 divisors (see below), whose sum is σ = 18079271019530. Its totient is φ = 5165506005576.
The previous prime is 10331012011139. The next prime is 10331012011157. The reversal of 10331012011156 is 65111021013301.
It can be written as a sum of positive squares in only one way, i.e., 6281459488656 + 4049552522500 = 2506284^2 + 2012350^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10331012011156.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331012011157) 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 as a sum of consecutive naturals, namely, 1291376501391 + ... + 1291376501398.
Almost surely, 210331012011156 is an apocalyptic number.
It is an amenable number.
10331012011156 is a deficient number, since it is larger than the sum of its proper divisors (7748259008374).
10331012011156 is a wasteful number, since it uses less digits than its factorization.
10331012011156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2582753002793 (or 2582753002791 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 25.
Adding to 10331012011156 its reverse (65111021013301), we get a palindrome (75442033024457).
The spelling of 10331012011156 in words is "ten trillion, three hundred thirty-one billion, twelve million, eleven thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •