Base | Representation |
---|---|
bin | 111101001110000… |
… | …110010100010110 |
3 | 2122120200101122120 |
4 | 331032012110112 |
5 | 4100414343240 |
6 | 245530240410 |
7 | 34311154224 |
oct | 7516062426 |
9 | 2576611576 |
10 | 1027106070 |
11 | 487857aa1 |
12 | 247b86106 |
13 | 134a3ab93 |
14 | 9a5a5b14 |
15 | 60287ad0 |
hex | 3d386516 |
1027106070 has 32 divisors (see below), whose sum is σ = 2466035712. Its totient is φ = 273785952.
The previous prime is 1027106053. The next prime is 1027106071. The reversal of 1027106070 is 706017201.
1027106070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1027106070.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1027106071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94539 + ... + 104841.
It is an arithmetic number, because the mean of its divisors is an integer number (77063616).
Almost surely, 21027106070 is an apocalyptic number.
1027106070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1027106070 is an abundant number, since it is smaller than the sum of its proper divisors (1438929642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1027106070 is a wasteful number, since it uses less digits than its factorization.
1027106070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13636.
The product of its (nonzero) digits is 588, while the sum is 24.
The square root of 1027106070 is about 32048.4955965175. The cubic root of 1027106070 is about 1008.9549265891.
The spelling of 1027106070 in words is "one billion, twenty-seven million, one hundred six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •