Base | Representation |
---|---|
bin | 10011100101001010… |
… | …11110100001010011 |
3 | 1000010121212022001021 |
4 | 21302211132201103 |
5 | 133012131032210 |
6 | 4455044220311 |
7 | 521335412263 |
oct | 116245364123 |
9 | 30117768037 |
10 | 10512361555 |
11 | 4504a54913 |
12 | 205469a697 |
13 | cb6bacca7 |
14 | 71a2157a3 |
15 | 417d68bda |
hex | 27295e853 |
10512361555 has 8 divisors (see below), whose sum is σ = 12640528944. Its totient is φ = 8392759200.
The previous prime is 10512361529. The next prime is 10512361619. The reversal of 10512361555 is 55516321501.
10512361555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10512361555 is a prime.
It is a super-2 number, since 2×105123615552 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10512361555.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2138556 + ... + 2143465.
It is an arithmetic number, because the mean of its divisors is an integer number (1580066118).
Almost surely, 210512361555 is an apocalyptic number.
10512361555 is a deficient number, since it is larger than the sum of its proper divisors (2128167389).
10512361555 is an equidigital number, since it uses as much as digits as its factorization.
10512361555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4282517.
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 10512361555 in words is "ten billion, five hundred twelve million, three hundred sixty-one thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •