Base | Representation |
---|---|
bin | 10011000111001110… |
… | …00000101101100010 |
3 | 222111010002011112200 |
4 | 21203213000231202 |
5 | 132003320334011 |
6 | 4414111034030 |
7 | 512164646331 |
oct | 114347005542 |
9 | 28433064480 |
10 | 10261105506 |
11 | 4396143493 |
12 | 1ba450b916 |
13 | c76b1a982 |
14 | 6d4acdd18 |
15 | 400c87856 |
hex | 2639c0b62 |
10261105506 has 96 divisors (see below), whose sum is σ = 23852320128. Its totient is φ = 3180122880.
The previous prime is 10261105501. The next prime is 10261105541. The reversal of 10261105506 is 60550116201.
It is a happy number.
10261105506 is a `hidden beast` number, since 102 + 6 + 1 + 1 + 0 + 550 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 10261105506.
It is not an unprimeable number, because it can be changed into a prime (10261105501) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5379805 + ... + 5381711.
It is an arithmetic number, because the mean of its divisors is an integer number (248461668).
Almost surely, 210261105506 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10261105506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11926160064).
10261105506 is an abundant number, since it is smaller than the sum of its proper divisors (13591214622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10261105506 is a wasteful number, since it uses less digits than its factorization.
10261105506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2296 (or 2293 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 10261105506 in words is "ten billion, two hundred sixty-one million, one hundred five thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •