Base | Representation |
---|---|
bin | 111011111010100… |
… | …111000010100000 |
3 | 2121001111110121101 |
4 | 323322213002200 |
5 | 4024314020000 |
6 | 243425204144 |
7 | 33624141361 |
oct | 7372470240 |
9 | 2531443541 |
10 | 1005220000 |
11 | 476469734 |
12 | 240790654 |
13 | 130347145 |
14 | 97709b68 |
15 | 5d3b2e6a |
hex | 3bea70a0 |
1005220000 has 60 divisors (see below), whose sum is σ = 2473041186. Its totient is φ = 402080000.
The previous prime is 1005219989. The next prime is 1005220009. The reversal of 1005220000 is 225001.
1005220000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 5 ways, for example, as 3370896 + 1001849104 = 1836^2 + 31652^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (1005220009) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5131 + ... + 45130.
Almost surely, 21005220000 is an apocalyptic number.
1005220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1005220000 is an abundant number, since it is smaller than the sum of its proper divisors (1467821186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1005220000 is an frugal number, since it uses more digits than its factorization.
1005220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50291 (or 50268 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 10.
The square root of 1005220000 is about 31705.2046200620. The cubic root of 1005220000 is about 1001.7369811496.
Adding to 1005220000 its reverse (225001), we get a palindrome (1005445001).
The spelling of 1005220000 in words is "one billion, five million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •