Base | Representation |
---|---|
bin | 100111010110001… |
… | …0111111001010100 |
3 | 10102000021220110120 |
4 | 1032230113321110 |
5 | 10200441130220 |
6 | 335001351540 |
7 | 44500661055 |
oct | 11654277124 |
9 | 3360256416 |
10 | 1320255060 |
11 | 618282193 |
12 | 30a1985b0 |
13 | 1806aa517 |
14 | c74b472c |
15 | 7ad91a40 |
hex | 4eb17e54 |
1320255060 has 24 divisors (see below), whose sum is σ = 3696714336. Its totient is φ = 352068000.
The previous prime is 1320255059. The next prime is 1320255077. The reversal of 1320255060 is 605520231.
It is a self number, because there is not a number n which added to its sum of digits gives 1320255060.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11002066 + ... + 11002185.
It is an arithmetic number, because the mean of its divisors is an integer number (154029764).
Almost surely, 21320255060 is an apocalyptic number.
1320255060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1320255060 is an abundant number, since it is smaller than the sum of its proper divisors (2376459276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320255060 is a wasteful number, since it uses less digits than its factorization.
1320255060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22004263 (or 22004261 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 1320255060 is about 36335.3142273464. The cubic root of 1320255060 is about 1097.0319602170.
Adding to 1320255060 its reverse (605520231), we get a palindrome (1925775291).
The spelling of 1320255060 in words is "one billion, three hundred twenty million, two hundred fifty-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •