Base | Representation |
---|---|
bin | 10011100110000111… |
… | …10011100101010001 |
3 | 1000011011211020012120 |
4 | 21303003303211101 |
5 | 133021144442040 |
6 | 4455530444453 |
7 | 521463114660 |
oct | 116303634521 |
9 | 30134736176 |
10 | 10520312145 |
11 | 4509495252 |
12 | 2057293729 |
13 | cb8734a95 |
14 | 71b2c4dd7 |
15 | 4188d97d0 |
hex | 2730f3951 |
10520312145 has 64 divisors (see below), whose sum is σ = 19549071360. Its totient is φ = 4731637248.
The previous prime is 10520312137. The next prime is 10520312177. The reversal of 10520312145 is 54121302501.
It is a happy number.
10520312145 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 10520312145 - 23 = 10520312137 is a prime.
It is a super-2 number, since 2×105203121452 (a number of 21 digits) contains 22 as substring.
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 63 ways as a sum of consecutive naturals, for example, 3578086 + ... + 3581024.
It is an arithmetic number, because the mean of its divisors is an integer number (305454240).
Almost surely, 210520312145 is an apocalyptic number.
10520312145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10520312145 is a deficient number, since it is larger than the sum of its proper divisors (9028759215).
10520312145 is a wasteful number, since it uses less digits than its factorization.
10520312145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3494.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 10520312145 its reverse (54121302501), we get a palindrome (64641614646).
The spelling of 10520312145 in words is "ten billion, five hundred twenty million, three hundred twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •