Base | Representation |
---|---|
bin | 111100100100100… |
… | …110101000010010 |
3 | 2121211012202020210 |
4 | 330210212220102 |
5 | 4040123301440 |
6 | 244501144550 |
7 | 34116540633 |
oct | 7444465022 |
9 | 2554182223 |
10 | 1016228370 |
11 | 4816a8463 |
12 | 2443bb156 |
13 | 1326cc981 |
14 | 98d7388a |
15 | 5e339a80 |
hex | 3c926a12 |
1016228370 has 16 divisors (see below), whose sum is σ = 2438948160. Its totient is φ = 270994224.
The previous prime is 1016228309. The next prime is 1016228371. The reversal of 1016228370 is 738226101.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 33874279 = 1016228370 / (1 + 0 + 1 + 6 + 2 + 2 + 8 + 3 + 7 + 0).
It is not an unprimeable number, because it can be changed into a prime (1016228371) 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, 16937110 + ... + 16937169.
It is an arithmetic number, because the mean of its divisors is an integer number (152434260).
Almost surely, 21016228370 is an apocalyptic number.
1016228370 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1016228370 is an abundant number, since it is smaller than the sum of its proper divisors (1422719790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1016228370 is a wasteful number, since it uses less digits than its factorization.
1016228370 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33874289.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 1016228370 is about 31878.3370017948. The cubic root of 1016228370 is about 1005.3804554457.
The spelling of 1016228370 in words is "one billion, sixteen million, two hundred twenty-eight thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •