Base | Representation |
---|---|
bin | 10011101000101000… |
… | …00100100011111111 |
3 | 1000012122102020010110 |
4 | 21310110010203333 |
5 | 133042041300330 |
6 | 4502001441103 |
7 | 522140011131 |
oct | 116424044377 |
9 | 30178366113 |
10 | 10541353215 |
11 | 451a356768 |
12 | 2062340193 |
13 | cbcbc1013 |
14 | 720001051 |
15 | 41a693db0 |
hex | 2745048ff |
10541353215 has 16 divisors (see below), whose sum is σ = 17599477248. Its totient is φ = 5377617696.
The previous prime is 10541353157. The next prime is 10541353223. The reversal of 10541353215 is 51235314501.
10541353215 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 10541353215 - 28 = 10541352959 is a prime.
It is a super-2 number, since 2×105413532152 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 15276979 + ... + 15277668.
It is an arithmetic number, because the mean of its divisors is an integer number (1099967328).
Almost surely, 210541353215 is an apocalyptic number.
10541353215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10541353215 is a deficient number, since it is larger than the sum of its proper divisors (7058124033).
10541353215 is a wasteful number, since it uses less digits than its factorization.
10541353215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30554678.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 10541353215 its reverse (51235314501), we get a palindrome (61776667716).
The spelling of 10541353215 in words is "ten billion, five hundred forty-one million, three hundred fifty-three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •