Base | Representation |
---|---|
bin | 111101011000110… |
… | …011100010000101 |
3 | 2122202221222122011 |
4 | 331120303202011 |
5 | 4102124201314 |
6 | 250110334221 |
7 | 34344053650 |
oct | 7530634205 |
9 | 2582858564 |
10 | 1029912709 |
11 | 4893a4731 |
12 | 248aba371 |
13 | 1354b1507 |
14 | 9aad6897 |
15 | 6063e4c4 |
hex | 3d633885 |
1029912709 has 4 divisors (see below), whose sum is σ = 1177043104. Its totient is φ = 882782316.
The previous prime is 1029912703. The next prime is 1029912713. The reversal of 1029912709 is 9072199201.
It is a happy number.
1029912709 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1029912709 - 23 = 1029912701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1029912701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73565187 + ... + 73565200.
It is an arithmetic number, because the mean of its divisors is an integer number (294260776).
Almost surely, 21029912709 is an apocalyptic number.
It is an amenable number.
1029912709 is a deficient number, since it is larger than the sum of its proper divisors (147130395).
1029912709 is an equidigital number, since it uses as much as digits as its factorization.
1029912709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147130394.
The product of its (nonzero) digits is 20412, while the sum is 40.
The square root of 1029912709 is about 32092.2530994631. The cubic root of 1029912709 is about 1009.8731040131.
The spelling of 1029912709 in words is "one billion, twenty-nine million, nine hundred twelve thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •