Base | Representation |
---|---|
bin | 111100010100111… |
… | …001111100111101 |
3 | 2121112110200022120 |
4 | 330110321330331 |
5 | 4033100110323 |
6 | 244233033153 |
7 | 34036551246 |
oct | 7424717475 |
9 | 2545420276 |
10 | 1012113213 |
11 | 47a347701 |
12 | 242b557b9 |
13 | 1318bb877 |
14 | 985c1ccd |
15 | 5dcc55e3 |
hex | 3c539f3d |
1012113213 has 8 divisors (see below), whose sum is σ = 1349784576. Its totient is φ = 674592000.
The previous prime is 1012113211. The next prime is 1012113227. The reversal of 1012113213 is 3123112101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012113213 - 21 = 1012113211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012113192 and 1012113201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012113211) 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, 20733 + ... + 49538.
It is an arithmetic number, because the mean of its divisors is an integer number (168723072).
Almost surely, 21012113213 is an apocalyptic number.
It is an amenable number.
1012113213 is a deficient number, since it is larger than the sum of its proper divisors (337671363).
1012113213 is an equidigital number, since it uses as much as digits as its factorization.
1012113213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75075.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1012113213 is about 31813.7268014925. The cubic root of 1012113213 is about 1004.0215431773.
Adding to 1012113213 its reverse (3123112101), we get a palindrome (4135225314).
The spelling of 1012113213 in words is "one billion, twelve million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •