Base | Representation |
---|---|
bin | 10011000111001110… |
… | …01111000110100010 |
3 | 222111010012011101210 |
4 | 21203213033012202 |
5 | 132003324230300 |
6 | 4414112210550 |
7 | 512165313225 |
oct | 114347170642 |
9 | 28433164353 |
10 | 10261164450 |
11 | 43961837a9 |
12 | 1ba4539a56 |
13 | c76b3b754 |
14 | 6d4b075bc |
15 | 400c9a050 |
hex | 2639cf1a2 |
10261164450 has 48 divisors (see below), whose sum is σ = 25454683296. Its totient is φ = 2735558400.
The previous prime is 10261164437. The next prime is 10261164451. The reversal of 10261164450 is 5446116201.
10261164450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (10261164451) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 732714 + ... + 746586.
It is an arithmetic number, because the mean of its divisors is an integer number (530305902).
Almost surely, 210261164450 is an apocalyptic number.
10261164450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10261164450 is an abundant number, since it is smaller than the sum of its proper divisors (15193518846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10261164450 is a wasteful number, since it uses less digits than its factorization.
10261164450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18819 (or 18814 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 10261164450 in words is "ten billion, two hundred sixty-one million, one hundred sixty-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •