Base | Representation |
---|---|
bin | 1100001100111… |
… | …01000001000101 |
3 | 21010121011200102 |
4 | 12012131001011 |
5 | 202200330023 |
6 | 14053453445 |
7 | 2352001055 |
oct | 606350105 |
9 | 233534612 |
10 | 102355013 |
11 | 5285a922 |
12 | 2a341285 |
13 | 182896c7 |
14 | d845565 |
15 | 8ebc628 |
hex | 619d045 |
102355013 has 4 divisors (see below), whose sum is σ = 103091520. Its totient is φ = 101618508.
The previous prime is 102355009. The next prime is 102355021. The reversal of 102355013 is 310553201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310553201 = 7 ⋅44364743.
It is a cyclic number.
It is not a de Polignac number, because 102355013 - 22 = 102355009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102355003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368045 + ... + 368322.
It is an arithmetic number, because the mean of its divisors is an integer number (25772880).
Almost surely, 2102355013 is an apocalyptic number.
It is an amenable number.
102355013 is a deficient number, since it is larger than the sum of its proper divisors (736507).
102355013 is an equidigital number, since it uses as much as digits as its factorization.
102355013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736506.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 102355013 is about 10117.0654342057. The cubic root of 102355013 is about 467.7743162109.
The spelling of 102355013 in words is "one hundred two million, three hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •