Base | Representation |
---|---|
bin | 111100011101001… |
… | …110101001000001 |
3 | 2121200120112022101 |
4 | 330131032221001 |
5 | 4034124420410 |
6 | 244351510401 |
7 | 34064236405 |
oct | 7435165101 |
9 | 2550515271 |
10 | 1014295105 |
11 | 4805a7a1a |
12 | 243828401 |
13 | 1321a3a25 |
14 | 989cd105 |
15 | 5e0a6d3a |
hex | 3c74ea41 |
1014295105 has 16 divisors (see below), whose sum is σ = 1248915024. Its totient is φ = 790328320.
The previous prime is 1014295099. The next prime is 1014295181. The reversal of 1014295105 is 5015924101.
1014295105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 318482+1.
It can be written as a sum of positive squares in 8 ways, for example, as 568536336 + 445758769 = 23844^2 + 21113^2 .
It is not a de Polignac number, because 1014295105 - 211 = 1014293057 is a prime.
It is a super-2 number, since 2×10142951052 = 2057589120053922050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130077 + ... + 137653.
It is an arithmetic number, because the mean of its divisors is an integer number (78057189).
Almost surely, 21014295105 is an apocalyptic number.
It is an amenable number.
1014295105 is a deficient number, since it is larger than the sum of its proper divisors (234619919).
1014295105 is an equidigital number, since it uses as much as digits as its factorization.
1014295105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8276.
The product of its (nonzero) digits is 1800, while the sum is 28.
The square root of 1014295105 is about 31848.0000156996. Note that the first 4 decimals coincide. The cubic root of 1014295105 is about 1004.7425080621.
The spelling of 1014295105 in words is "one billion, fourteen million, two hundred ninety-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •