Base | Representation |
---|---|
bin | 11001000011111011010100… |
… | …001001100000001110000100 |
3 | 112110021000200200212121111111 |
4 | 121003323110021200032010 |
5 | 103421330112030323022 |
6 | 1030230455531214404 |
7 | 32134130243565145 |
oct | 3103732411401604 |
9 | 473230620777444 |
10 | 110221010011012 |
11 | 3213551677165a |
12 | 104416a12a7404 |
13 | 4966a482cbcc4 |
14 | 1d30a224ddacc |
15 | cb217c410477 |
hex | 643ed4260384 |
110221010011012 has 6 divisors (see below), whose sum is σ = 192886767519278. Its totient is φ = 55110505005504.
The previous prime is 110221010011001. The next prime is 110221010011061. The reversal of 110221010011012 is 210110010122011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 55811149310596 + 54409860700416 = 7470686^2 + 7376304^2 .
It is a super-2 number, since 2×1102210100110122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110221010010983 and 110221010011001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13777626251373 + ... + 13777626251380.
Almost surely, 2110221010011012 is an apocalyptic number.
It is an amenable number.
110221010011012 is a deficient number, since it is larger than the sum of its proper divisors (82665757508266).
110221010011012 is a wasteful number, since it uses less digits than its factorization.
110221010011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27555252502757 (or 27555252502755 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110221010011012 its reverse (210110010122011), we get a palindrome (320331020133023).
The spelling of 110221010011012 in words is "one hundred ten trillion, two hundred twenty-one billion, ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •