Base | Representation |
---|---|
bin | 1111010111100101110… |
… | …0110100111110100100 |
3 | 221020111202011110011110 |
4 | 3311321130310332210 |
5 | 13311213313331340 |
6 | 321143300105020 |
7 | 25034632054224 |
oct | 3657134647644 |
9 | 836452143143 |
10 | 264030605220 |
11 | a1a7a436658 |
12 | 43207395170 |
13 | 1bb89b25365 |
14 | cac9db4084 |
15 | 6d04995680 |
hex | 3d79734fa4 |
264030605220 has 96 divisors (see below), whose sum is σ = 742054908672. Its totient is φ = 70144933888.
The previous prime is 264030605203. The next prime is 264030605227. The reversal of 264030605220 is 22506030462.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (264030605227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17889364 + ... + 17904116.
It is an arithmetic number, because the mean of its divisors is an integer number (7729738632).
Almost surely, 2264030605220 is an apocalyptic number.
264030605220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
264030605220 is an abundant number, since it is smaller than the sum of its proper divisors (478024303452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264030605220 is a wasteful number, since it uses less digits than its factorization.
264030605220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15861 (or 15859 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 264030605220 its reverse (22506030462), we get a palindrome (286536635682).
The spelling of 264030605220 in words is "two hundred sixty-four billion, thirty million, six hundred five thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •