Base | Representation |
---|---|
bin | 101111101001011010… |
… | …0000001110010111101 |
3 | 100210002221012112121221 |
4 | 1133102310001302331 |
5 | 3134023200231023 |
6 | 115001120153341 |
7 | 10251420005524 |
oct | 1372264016275 |
9 | 323087175557 |
10 | 102321102013 |
11 | 3a43765a429 |
12 | 179b7168851 |
13 | 98586627a0 |
14 | 4d494234bb |
15 | 29dcdc885d |
hex | 17d2d01cbd |
102321102013 has 8 divisors (see below), whose sum is σ = 110199093368. Its totient is φ = 94444130304.
The previous prime is 102321102011. The next prime is 102321102073. The reversal of 102321102013 is 310201123201.
It can be written as a sum of positive squares in 4 ways, for example, as 21938645689 + 80382456324 = 148117^2 + 283518^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 102321102013 - 21 = 102321102011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102321102011) 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, 39756 + ... + 454117.
It is an arithmetic number, because the mean of its divisors is an integer number (13774886671).
Almost surely, 2102321102013 is an apocalyptic number.
102321102013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102321102013 is a deficient number, since it is larger than the sum of its proper divisors (7877991355).
102321102013 is a wasteful number, since it uses less digits than its factorization.
102321102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 509823.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102321102013 its reverse (310201123201), we get a palindrome (412522225214).
The spelling of 102321102013 in words is "one hundred two billion, three hundred twenty-one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •