Base | Representation |
---|---|
bin | 100000001100111… |
… | …0100001010001110 |
3 | 2210022011112210110 |
4 | 1000121310022032 |
5 | 4203102242240 |
6 | 255115020450 |
7 | 35530114134 |
oct | 10031641216 |
9 | 2708145713 |
10 | 1080509070 |
11 | 504a12503 |
12 | 261a3a726 |
13 | 142b181a4 |
14 | a3707754 |
15 | 64cd5c80 |
hex | 4067428e |
1080509070 has 64 divisors (see below), whose sum is σ = 2643102720. Its totient is φ = 282642048.
The previous prime is 1080509063. The next prime is 1080509077. The reversal of 1080509070 is 709050801.
It is an interprime number because it is at equal distance from previous prime (1080509063) and next prime (1080509077).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1080509077) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 384912 + ... + 387708.
It is an arithmetic number, because the mean of its divisors is an integer number (41298480).
Almost surely, 21080509070 is an apocalyptic number.
1080509070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1080509070 is an abundant number, since it is smaller than the sum of its proper divisors (1562593650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1080509070 is a wasteful number, since it uses less digits than its factorization.
1080509070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3049.
The product of its (nonzero) digits is 2520, while the sum is 30.
The square root of 1080509070 is about 32871.0977912208. The cubic root of 1080509070 is about 1026.1467459168.
Adding to 1080509070 its reverse (709050801), we get a palindrome (1789559871).
The spelling of 1080509070 in words is "one billion, eighty million, five hundred nine thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •