Base | Representation |
---|---|
bin | 10111001100010010111010… |
… | …011011001000110000001010 |
3 | 111101011002212010220022122220 |
4 | 113030102322123020300022 |
5 | 101332132010310140242 |
6 | 1000534054055554510 |
7 | 30325154234262411 |
oct | 2714227233106012 |
9 | 441132763808586 |
10 | 102000011021322 |
11 | 2a555a640a5497 |
12 | b53435138ba36 |
13 | 44bb737a689bb |
14 | 1b28b80d30478 |
15 | bbd3c3727bec |
hex | 5cc4ba6c8c0a |
102000011021322 has 8 divisors (see below), whose sum is σ = 204000022042656. Its totient is φ = 34000003673772.
The previous prime is 102000011021299. The next prime is 102000011021327. The reversal of 102000011021322 is 223120110000201.
It is a sphenic number, since it is the product of 3 distinct primes.
102000011021322 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (102000011021327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8500000918438 + ... + 8500000918449.
It is an arithmetic number, because the mean of its divisors is an integer number (25500002755332).
Almost surely, 2102000011021322 is an apocalyptic number.
102000011021322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000011021322 is a wasteful number, since it uses less digits than its factorization.
102000011021322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17000001836892.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102000011021322 its reverse (223120110000201), we get a palindrome (325120121021523).
The spelling of 102000011021322 in words is "one hundred two trillion, eleven million, twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •