Base | Representation |
---|---|
bin | 100000000011001… |
… | …0110000110100101 |
3 | 2202221120020122000 |
4 | 1000012112012211 |
5 | 4200300431341 |
6 | 254413355513 |
7 | 35435536122 |
oct | 10006260645 |
9 | 2687506560 |
10 | 1075405221 |
11 | 502046950 |
12 | 260198b99 |
13 | 141a4c067 |
14 | a2b79749 |
15 | 646288b6 |
hex | 401961a5 |
1075405221 has 32 divisors (see below), whose sum is σ = 1794109440. Its totient is φ = 630730800.
The previous prime is 1075405217. The next prime is 1075405223. The reversal of 1075405221 is 1225045701.
It is not a de Polignac number, because 1075405221 - 22 = 1075405217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1075405223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49195 + ... + 67608.
It is an arithmetic number, because the mean of its divisors is an integer number (56065920).
Almost surely, 21075405221 is an apocalyptic number.
1075405221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1075405221 is a deficient number, since it is larger than the sum of its proper divisors (718704219).
1075405221 is a wasteful number, since it uses less digits than its factorization.
1075405221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116854 (or 116848 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 1075405221 is about 32793.3716015905. The cubic root of 1075405221 is about 1024.5285068458.
The spelling of 1075405221 in words is "one billion, seventy-five million, four hundred five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •