Base | Representation |
---|---|
bin | 111101101000110… |
… | …011011100010101 |
3 | 2200001212001122010 |
4 | 331220303130111 |
5 | 4104212403040 |
6 | 250340254433 |
7 | 34424522115 |
oct | 7550633425 |
9 | 2601761563 |
10 | 1034106645 |
11 | 4907a96a0 |
12 | 24a3a1419 |
13 | 13631c430 |
14 | 9b4a9045 |
15 | 60bbbe80 |
hex | 3da33715 |
1034106645 has 32 divisors (see below), whose sum is σ = 1943835264. Its totient is φ = 462816000.
The previous prime is 1034106641. The next prime is 1034106683. The reversal of 1034106645 is 5466014301.
It is not a de Polignac number, because 1034106645 - 22 = 1034106641 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034106641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 238906 + ... + 243195.
It is an arithmetic number, because the mean of its divisors is an integer number (60744852).
Almost surely, 21034106645 is an apocalyptic number.
1034106645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1034106645 is a deficient number, since it is larger than the sum of its proper divisors (909728619).
1034106645 is a wasteful number, since it uses less digits than its factorization.
1034106645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482133.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 1034106645 is about 32157.5285897408. The cubic root of 1034106645 is about 1011.2420249411.
The spelling of 1034106645 in words is "one billion, thirty-four million, one hundred six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •