Base | Representation |
---|---|
bin | 11101011011100010111… |
… | …10000100001000100111 |
3 | 10120200010201202100211200 |
4 | 32231301132010020213 |
5 | 113031440040134343 |
6 | 2052314251533543 |
7 | 133025666600430 |
oct | 16556136041047 |
9 | 3520121670750 |
10 | 1011221021223 |
11 | 35a9469a4256 |
12 | 143b93a5a2b3 |
13 | 74485c2a67a |
14 | 36d2c80c487 |
15 | 1b4869134d3 |
hex | eb71784227 |
1011221021223 has 48 divisors (see below), whose sum is σ = 1729550983680. Its totient is φ = 557052084288.
The previous prime is 1011221021159. The next prime is 1011221021249. The reversal of 1011221021223 is 3221201221101.
1011221021223 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1011221021223 - 26 = 1011221021159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011221021196 and 1011221021205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011221021263) 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, 754336 + ... + 1609802.
It is an arithmetic number, because the mean of its divisors is an integer number (36032312160).
Almost surely, 21011221021223 is an apocalyptic number.
1011221021223 is a deficient number, since it is larger than the sum of its proper divisors (718329962457).
1011221021223 is a wasteful number, since it uses less digits than its factorization.
1011221021223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856156 (or 856153 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1011221021223 its reverse (3221201221101), we get a palindrome (4232422242324).
The spelling of 1011221021223 in words is "one trillion, eleven billion, two hundred twenty-one million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •