Base | Representation |
---|---|
bin | 1101100000010010… |
… | …1111000100010101 |
3 | 100100122022011210111 |
4 | 3120010233010111 |
5 | 24411012320041 |
6 | 1355414523021 |
7 | 155556004015 |
oct | 33004570425 |
9 | 10318264714 |
10 | 3625120021 |
11 | 15a0316366 |
12 | 852066471 |
13 | 45a066b43 |
14 | 26564bc45 |
15 | 1633c4981 |
hex | d812f115 |
3625120021 has 4 divisors (see below), whose sum is σ = 3625588000. Its totient is φ = 3624652044.
The previous prime is 3625120019. The next prime is 3625120043. The reversal of 3625120021 is 1200215263.
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.
It is a cyclic number.
It is not a de Polignac number, because 3625120021 - 21 = 3625120019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3625119974 and 3625120001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3625120721) 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, 222171 + ... + 237928.
It is an arithmetic number, because the mean of its divisors is an integer number (906397000).
Almost surely, 23625120021 is an apocalyptic number.
It is an amenable number.
3625120021 is a deficient number, since it is larger than the sum of its proper divisors (467979).
3625120021 is an equidigital number, since it uses as much as digits as its factorization.
3625120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467978.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 3625120021 is about 60208.9696058652. The cubic root of 3625120021 is about 1536.1753663357.
Adding to 3625120021 its reverse (1200215263), we get a palindrome (4825335284).
The spelling of 3625120021 in words is "three billion, six hundred twenty-five million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •