Base | Representation |
---|---|
bin | 10011000001101000… |
… | …10010111110010111 |
3 | 222100211220222211121 |
4 | 21200310102332113 |
5 | 131404322202120 |
6 | 4405314544411 |
7 | 511055514400 |
oct | 114064227627 |
9 | 28324828747 |
10 | 10214256535 |
11 | 437175512a |
12 | 1b90898107 |
13 | c6a1c68a2 |
14 | 6cc7b69a7 |
15 | 3ebad15aa |
hex | 260d12f97 |
10214256535 has 12 divisors (see below), whose sum is σ = 14258268648. Its totient is φ = 7004061456.
The previous prime is 10214256509. The next prime is 10214256541. The reversal of 10214256535 is 53565241201.
10214256535 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 10214256535 - 29 = 10214256023 is a prime.
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 10214256535.
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 11 ways as a sum of consecutive naturals, for example, 20845177 + ... + 20845666.
It is an arithmetic number, because the mean of its divisors is an integer number (1188189054).
Almost surely, 210214256535 is an apocalyptic number.
10214256535 is a deficient number, since it is larger than the sum of its proper divisors (4044012113).
10214256535 is an equidigital number, since it uses as much as digits as its factorization.
10214256535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41690862 (or 41690855 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 10214256535 its reverse (53565241201), we get a palindrome (63779497736).
The spelling of 10214256535 in words is "ten billion, two hundred fourteen million, two hundred fifty-six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •