Base | Representation |
---|---|
bin | 101111100110001110… |
… | …0100111000110000011 |
3 | 100202211111020102212010 |
4 | 1133030130213012003 |
5 | 3133313330100120 |
6 | 114542343104003 |
7 | 10245652133511 |
oct | 1371434470603 |
9 | 322744212763 |
10 | 102214300035 |
11 | 3a392342531 |
12 | 17987442003 |
13 | 983c4a9c53 |
14 | 4d391814b1 |
15 | 29d382d7e0 |
hex | 17cc727183 |
102214300035 has 96 divisors (see below), whose sum is σ = 174706481664. Its totient is φ = 50996736000.
The previous prime is 102214300033. The next prime is 102214300051. The reversal of 102214300035 is 530003412201.
It is not a de Polignac number, because 102214300035 - 21 = 102214300033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102214299984 and 102214300020.
It is not an unprimeable number, because it can be changed into a prime (102214300031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 63843235 + ... + 63844835.
It is an arithmetic number, because the mean of its divisors is an integer number (1819859184).
Almost surely, 2102214300035 is an apocalyptic number.
102214300035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102214300035 is a deficient number, since it is larger than the sum of its proper divisors (72492181629).
102214300035 is a wasteful number, since it uses less digits than its factorization.
102214300035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1817 (or 1786 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 102214300035 its reverse (530003412201), we get a palindrome (632217712236).
The spelling of 102214300035 in words is "one hundred two billion, two hundred fourteen million, three hundred thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •