Base | Representation |
---|---|
bin | 111011111101110… |
… | …0100001000110111 |
3 | 12012020010102201121 |
4 | 1313323210020313 |
5 | 13110044300343 |
6 | 531354204411 |
7 | 100601411104 |
oct | 16773441067 |
9 | 5166112647 |
10 | 2012103223 |
11 | 942863a29 |
12 | 481a23707 |
13 | 260b24330 |
14 | 151329aab |
15 | bb9a3aed |
hex | 77ee4237 |
2012103223 has 8 divisors (see below), whose sum is σ = 2167452000. Its totient is φ = 1856836128.
The previous prime is 2012103209. The next prime is 2012103271. The reversal of 2012103223 is 3223012102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012103223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012103197 and 2012103206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012103283) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 36678 + ... + 73276.
It is an arithmetic number, because the mean of its divisors is an integer number (270931500).
Almost surely, 22012103223 is an apocalyptic number.
2012103223 is a deficient number, since it is larger than the sum of its proper divisors (155348777).
2012103223 is a wasteful number, since it uses less digits than its factorization.
2012103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40841.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2012103223 is about 44856.4735907762. The cubic root of 2012103223 is about 1262.4574578744.
Adding to 2012103223 its reverse (3223012102), we get a palindrome (5235115325).
The spelling of 2012103223 in words is "two billion, twelve million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •