Base | Representation |
---|---|
bin | 10011110011011100… |
… | …10111110111100001 |
3 | 1000102222020101002221 |
4 | 21321232113313201 |
5 | 133233311242423 |
6 | 4515003311041 |
7 | 524321435356 |
oct | 117156276741 |
9 | 30388211087 |
10 | 10632134113 |
11 | 45666207a7 |
12 | 208881b481 |
13 | 1005957523 |
14 | 72c0b262d |
15 | 423626e5d |
hex | 279b97de1 |
10632134113 has 8 divisors (see below), whose sum is σ = 10665545000. Its totient is φ = 10598750208.
The previous prime is 10632134089. The next prime is 10632134143. The reversal of 10632134113 is 31143123601.
It can be written as a sum of positive squares in 4 ways, for example, as 61826769 + 10570307344 = 7863^2 + 102812^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10632134113 - 225 = 10598579681 is a prime.
It is a super-2 number, since 2×106321341132 (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 (10632134143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1020193 + ... + 1030561.
It is an arithmetic number, because the mean of its divisors is an integer number (1333193125).
Almost surely, 210632134113 is an apocalyptic number.
It is an amenable number.
10632134113 is a deficient number, since it is larger than the sum of its proper divisors (33410887).
10632134113 is a wasteful number, since it uses less digits than its factorization.
10632134113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13491.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10632134113 its reverse (31143123601), we get a palindrome (41775257714).
The spelling of 10632134113 in words is "ten billion, six hundred thirty-two million, one hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •