Base | Representation |
---|---|
bin | 1001001101000101111111… |
… | …0111011011001001100110 |
3 | 1022211111220121210111222200 |
4 | 2103101133313123021212 |
5 | 2311303342114022042 |
6 | 33305152254035330 |
7 | 2063120460533232 |
oct | 223213767331146 |
9 | 38744817714880 |
10 | 10120551314022 |
11 | 3252113413566 |
12 | 11755201a8b46 |
13 | 5854966231b6 |
14 | 26dba17875c2 |
15 | 1283d34eac4c |
hex | 9345fddb266 |
10120551314022 has 12 divisors (see below), whose sum is σ = 21927861180420. Its totient is φ = 3373517104668.
The previous prime is 10120551313993. The next prime is 10120551314033. The reversal of 10120551314022 is 22041315502101.
It is a happy number.
10120551314022 is a `hidden beast` number, since 1 + 0 + 1 + 2 + 0 + 5 + 513 + 140 + 2 + 2 = 666.
It is a super-3 number, since 3×101205513140223 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 281126425372 + ... + 281126425407.
It is an arithmetic number, because the mean of its divisors is an integer number (1827321765035).
Almost surely, 210120551314022 is an apocalyptic number.
10120551314022 is an abundant number, since it is smaller than the sum of its proper divisors (11807309866398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120551314022 is a wasteful number, since it uses less digits than its factorization.
10120551314022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562252850787 (or 562252850784 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 10120551314022 its reverse (22041315502101), we get a palindrome (32161866816123).
The spelling of 10120551314022 in words is "ten trillion, one hundred twenty billion, five hundred fifty-one million, three hundred fourteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •