Base | Representation |
---|---|
bin | 10011100100010111… |
… | …01110011100101011 |
3 | 1000010011011100002121 |
4 | 21302023232130223 |
5 | 133003414023201 |
6 | 4454243412111 |
7 | 521224135435 |
oct | 116213563453 |
9 | 30104140077 |
10 | 10505611051 |
11 | 4501164091 |
12 | 2052384037 |
13 | cb5688500 |
14 | 719379655 |
15 | 4174839a1 |
hex | 2722ee72b |
10505611051 has 12 divisors (see below), whose sum is σ = 11488549680. Its totient is φ = 9601456800.
The previous prime is 10505611037. The next prime is 10505611139. The reversal of 10505611051 is 15011650501.
It is not a de Polignac number, because 10505611051 - 25 = 10505611019 is a prime.
It is a super-2 number, since 2×105056110512 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10505614051) 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, 290671 + ... + 324808.
It is an arithmetic number, because the mean of its divisors is an integer number (957379140).
Almost surely, 210505611051 is an apocalyptic number.
10505611051 is a deficient number, since it is larger than the sum of its proper divisors (982938629).
10505611051 is a wasteful number, since it uses less digits than its factorization.
10505611051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615606 (or 615593 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 10505611051 in words is "ten billion, five hundred five million, six hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •