Base | Representation |
---|---|
bin | 10111010000111101000111… |
… | …001100010101111000011101 |
3 | 111102021201022200112111022200 |
4 | 113100331013030111320131 |
5 | 101402403232234412201 |
6 | 1001341130123402113 |
7 | 30360250643315631 |
oct | 2720750714257035 |
9 | 442251280474280 |
10 | 102320200310301 |
11 | 2a669831658386 |
12 | b586410083339 |
13 | 45129a454913c |
14 | 1b3a47754cdc1 |
15 | bc68b3593386 |
hex | 5d0f47315e1d |
102320200310301 has 48 divisors (see below), whose sum is σ = 149605525637568. Its totient is φ = 67381403616000.
The previous prime is 102320200310297. The next prime is 102320200310311. The reversal of 102320200310301 is 103013002023201.
102320200310301 is a `hidden beast` number, since 1 + 0 + 2 + 32 + 0 + 20 + 0 + 310 + 301 = 666.
It is not a de Polignac number, because 102320200310301 - 22 = 102320200310297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102320200310311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4989515290 + ... + 4989535796.
It is an arithmetic number, because the mean of its divisors is an integer number (3116781784116).
Almost surely, 2102320200310301 is an apocalyptic number.
It is an amenable number.
102320200310301 is a deficient number, since it is larger than the sum of its proper divisors (47285325327267).
102320200310301 is a wasteful number, since it uses less digits than its factorization.
102320200310301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33082 (or 33079 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 102320200310301 its reverse (103013002023201), we get a palindrome (205333202333502).
The spelling of 102320200310301 in words is "one hundred two trillion, three hundred twenty billion, two hundred million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •