Base | Representation |
---|---|
bin | 101011111100110011011… |
… | …101000000110000001101 |
3 | 101200201201200122112212001 |
4 | 223330303131000300031 |
5 | 343440410131033430 |
6 | 10231250004512301 |
7 | 431126666031316 |
oct | 53746335006015 |
9 | 11621650575761 |
10 | 3020225252365 |
11 | a64963466182 |
12 | 40940b3ab691 |
13 | 18ba62a93b59 |
14 | a627309560d |
15 | 5386a1563ca |
hex | 2bf33740c0d |
3020225252365 has 4 divisors (see below), whose sum is σ = 3624270302844. Its totient is φ = 2416180201888.
The previous prime is 3020225252357. The next prime is 3020225252377. The reversal of 3020225252365 is 5632525220203.
3020225252365 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2057509097604 + 962716154761 = 1434402^2 + 981181^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020225252365 - 23 = 3020225252357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 302022525232 + ... + 302022525241.
It is an arithmetic number, because the mean of its divisors is an integer number (906067575711).
Almost surely, 23020225252365 is an apocalyptic number.
It is an amenable number.
3020225252365 is a deficient number, since it is larger than the sum of its proper divisors (604045050479).
3020225252365 is an equidigital number, since it uses as much as digits as its factorization.
3020225252365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604045050478.
The product of its (nonzero) digits is 216000, while the sum is 37.
The spelling of 3020225252365 in words is "three trillion, twenty billion, two hundred twenty-five million, two hundred fifty-two thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •