Base | Representation |
---|---|
bin | 10011100100011010… |
… | …11100010111000011 |
3 | 1000010012000012122200 |
4 | 21302031130113003 |
5 | 133004022430001 |
6 | 4454301204243 |
7 | 521231022120 |
oct | 116215342703 |
9 | 30105005580 |
10 | 10506061251 |
11 | 4501441354 |
12 | 2052560683 |
13 | cb57b53ba |
14 | 719455747 |
15 | 417522086 |
hex | 27235c5c3 |
10506061251 has 48 divisors (see below), whose sum is σ = 18404066304. Its totient is φ = 5637848832.
The previous prime is 10506061213. The next prime is 10506061259. The reversal of 10506061251 is 15216060501.
It is a happy number.
10506061251 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 606 + 1 + 2 + 51 = 666.
10506061251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10506061251 - 29 = 10506060739 is a prime.
It is a super-2 number, since 2×105060612512 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10506061259) 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 47 ways as a sum of consecutive naturals, for example, 485280 + ... + 506466.
It is an arithmetic number, because the mean of its divisors is an integer number (383418048).
Almost surely, 210506061251 is an apocalyptic number.
10506061251 is a deficient number, since it is larger than the sum of its proper divisors (7898005053).
10506061251 is a wasteful number, since it uses less digits than its factorization.
10506061251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21680 (or 21677 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 10506061251 in words is "ten billion, five hundred six million, sixty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •