Base | Representation |
---|---|
bin | 101000100010… |
… | …111111001101 |
3 | 202000000100020 |
4 | 220202333031 |
5 | 10210112234 |
6 | 1015452353 |
7 | 156226353 |
oct | 50427715 |
9 | 22000306 |
10 | 10629069 |
11 | 5aaa860 |
12 | 36870b9 |
13 | 2281cb9 |
14 | 15a97d3 |
15 | dee549 |
hex | a22fcd |
10629069 has 8 divisors (see below), whose sum is σ = 15460512. Its totient is φ = 6441840.
The previous prime is 10629061. The next prime is 10629071. The reversal of 10629069 is 96092601.
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 10629069 - 23 = 10629061 is a prime.
It is a super-2 number, since 2×106290692 = 225954215613522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 322093 = 10629069 / (1 + 0 + 6 + 2 + 9 + 0 + 6 + 9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10629061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161014 + ... + 161079.
It is an arithmetic number, because the mean of its divisors is an integer number (1932564).
Almost surely, 210629069 is an apocalyptic number.
It is an amenable number.
10629069 is a deficient number, since it is larger than the sum of its proper divisors (4831443).
10629069 is a wasteful number, since it uses less digits than its factorization.
10629069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322107.
The product of its (nonzero) digits is 5832, while the sum is 33.
The square root of 10629069 is about 3260.2252989632. The cubic root of 10629069 is about 219.8695438692.
The spelling of 10629069 in words is "ten million, six hundred twenty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •