Base | Representation |
---|---|
bin | 1001000110101010111110… |
… | …1011110101011000001111 |
3 | 1022102222010112102021000200 |
4 | 2101222233223311120033 |
5 | 2303001413123201221 |
6 | 33142344315024543 |
7 | 2052133421111355 |
oct | 221525753653017 |
9 | 38388115367020 |
10 | 10010221303311 |
11 | 320a346a61529 |
12 | 115806aa3b153 |
13 | 577c6294b6a8 |
14 | 2686d681b7d5 |
15 | 1255c7467426 |
hex | 91aafaf560f |
10010221303311 has 48 divisors (see below), whose sum is σ = 14718750096960. Its totient is φ = 6554427102720.
The previous prime is 10010221303273. The next prime is 10010221303337. The reversal of 10010221303311 is 11330312201001.
10010221303311 is a `hidden beast` number, since 100 + 1 + 0 + 221 + 30 + 3 + 311 = 666.
It is a de Polignac number, because none of the positive numbers 2k-10010221303311 is a prime.
It is a super-2 number, since 2×100102213033112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010221302311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 546131995 + ... + 546150323.
It is an arithmetic number, because the mean of its divisors is an integer number (306640627020).
Almost surely, 210010221303311 is an apocalyptic number.
10010221303311 is a deficient number, since it is larger than the sum of its proper divisors (4708528793649).
10010221303311 is a wasteful number, since it uses less digits than its factorization.
10010221303311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21616 (or 21613 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10010221303311 its reverse (11330312201001), we get a palindrome (21340533504312).
The spelling of 10010221303311 in words is "ten trillion, ten billion, two hundred twenty-one million, three hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •