Base | Representation |
---|---|
bin | 10011110110111001… |
… | …00001111001101010 |
3 | 1000111222120110211010 |
4 | 21323130201321222 |
5 | 133313204323200 |
6 | 4521514244350 |
7 | 525122045604 |
oct | 117334417152 |
9 | 30458513733 |
10 | 10661011050 |
11 | 4580954438 |
12 | 20964266b6 |
13 | 100b928281 |
14 | 731c6c174 |
15 | 425e2d150 |
hex | 27b721e6a |
10661011050 has 24 divisors (see below), whose sum is σ = 26439307776. Its totient is φ = 2842936240.
The previous prime is 10661011033. The next prime is 10661011051. The reversal of 10661011050 is 5011016601.
It is a super-2 number, since 2×106610110502 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10661011051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35536554 + ... + 35536853.
It is an arithmetic number, because the mean of its divisors is an integer number (1101637824).
Almost surely, 210661011050 is an apocalyptic number.
10661011050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10661011050 is an abundant number, since it is smaller than the sum of its proper divisors (15778296726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10661011050 is a wasteful number, since it uses less digits than its factorization.
10661011050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71073422 (or 71073417 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 10661011050 its reverse (5011016601), we get a palindrome (15672027651).
The spelling of 10661011050 in words is "ten billion, six hundred sixty-one million, eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •