Base | Representation |
---|---|
bin | 111100010001011… |
… | …110001110100111 |
3 | 2121110202221202121 |
4 | 330101132032213 |
5 | 4032332310343 |
6 | 244201450411 |
7 | 34026112336 |
oct | 7421361647 |
9 | 2543687677 |
10 | 1011213223 |
11 | 479892509 |
12 | 2427a0a07 |
13 | 131665027 |
14 | 98429d1d |
15 | 5db98aed |
hex | 3c45e3a7 |
1011213223 has 4 divisors (see below), whose sum is σ = 1017268560. Its totient is φ = 1005157888.
The previous prime is 1011213221. The next prime is 1011213253. The reversal of 1011213223 is 3223121101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1011213223 - 21 = 1011213221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011213197 and 1011213206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011213221) 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 in 3 ways as a sum of consecutive naturals, for example, 3027418 + ... + 3027751.
It is an arithmetic number, because the mean of its divisors is an integer number (254317140).
Almost surely, 21011213223 is an apocalyptic number.
1011213223 is a deficient number, since it is larger than the sum of its proper divisors (6055337).
1011213223 is an equidigital number, since it uses as much as digits as its factorization.
1011213223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6055336.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1011213223 is about 31799.5789752003. The cubic root of 1011213223 is about 1003.7238566784.
Adding to 1011213223 its reverse (3223121101), we get a palindrome (4234334324).
The spelling of 1011213223 in words is "one billion, eleven million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •