Base | Representation |
---|---|
bin | 111100011101110… |
… | …100100000100101 |
3 | 2121200212102002010 |
4 | 330131310200211 |
5 | 4034144401323 |
6 | 244355104433 |
7 | 34065453540 |
oct | 7435644045 |
9 | 2550772063 |
10 | 1014450213 |
11 | 4806a3507 |
12 | 2438a2119 |
13 | 1322294ca |
14 | 98a2d857 |
15 | 5e0d7c93 |
hex | 3c774825 |
1014450213 has 32 divisors (see below), whose sum is σ = 1631232000. Its totient is φ = 548228736.
The previous prime is 1014450211. The next prime is 1014450233. The reversal of 1014450213 is 3120544101.
1014450213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1014450213 - 21 = 1014450211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1014450213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014450211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31188 + ... + 54786.
It is an arithmetic number, because the mean of its divisors is an integer number (50976000).
Almost surely, 21014450213 is an apocalyptic number.
It is an amenable number.
1014450213 is a deficient number, since it is larger than the sum of its proper divisors (616781787).
1014450213 is a wasteful number, since it uses less digits than its factorization.
1014450213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23721.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1014450213 is about 31850.4350519738. The cubic root of 1014450213 is about 1004.7937211843.
Adding to 1014450213 its reverse (3120544101), we get a palindrome (4134994314).
The spelling of 1014450213 in words is "one billion, fourteen million, four hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •