Base | Representation |
---|---|
bin | 10100011001100100… |
… | …11111110110100110 |
3 | 1001021021002100121120 |
4 | 22030302133312212 |
5 | 134412201420002 |
6 | 5010430554410 |
7 | 535254213066 |
oct | 121462376646 |
9 | 31237070546 |
10 | 10951982502 |
11 | 471012160a |
12 | 2157968a06 |
13 | 1056cb4726 |
14 | 75c7713a6 |
15 | 441756cbc |
hex | 28cc9fda6 |
10951982502 has 16 divisors (see below), whose sum is σ = 21930460992. Its totient is φ = 3646244840.
The previous prime is 10951982453. The next prime is 10951982507. The reversal of 10951982502 is 20528915901.
It is a super-3 number, since 3×109519825023 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10951982507) 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 7 ways as a sum of consecutive naturals, for example, 1098624 + ... + 1108547.
It is an arithmetic number, because the mean of its divisors is an integer number (1370653812).
Almost surely, 210951982502 is an apocalyptic number.
10951982502 is an abundant number, since it is smaller than the sum of its proper divisors (10978478490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10951982502 is a wasteful number, since it uses less digits than its factorization.
10951982502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2208003.
The product of its (nonzero) digits is 64800, while the sum is 42.
The spelling of 10951982502 in words is "ten billion, nine hundred fifty-one million, nine hundred eighty-two thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •