Base | Representation |
---|---|
bin | 1000001111000001… |
… | …10110100101111111 |
3 | 102102002221002100122 |
4 | 10013200312211333 |
5 | 33023240120111 |
6 | 2010405445155 |
7 | 214362023141 |
oct | 40740664577 |
9 | 12362832318 |
10 | 4421020031 |
11 | 196960686a |
12 | a347107bb |
13 | 555c127ac |
14 | 2dd22ac91 |
15 | 1ad1dbcdb |
hex | 10783697f |
4421020031 has 8 divisors (see below), whose sum is σ = 4431239760. Its totient is φ = 4410813888.
The previous prime is 4421020027. The next prime is 4421020033. The reversal of 4421020031 is 1300201244.
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 4421020031 - 22 = 4421020027 is a prime.
It is a super-2 number, since 2×44210200312 = 39090836229006481922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4421019991 and 4421020009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4421020033) 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, 901835 + ... + 906723.
It is an arithmetic number, because the mean of its divisors is an integer number (553904970).
Almost surely, 24421020031 is an apocalyptic number.
4421020031 is a deficient number, since it is larger than the sum of its proper divisors (10219729).
4421020031 is an equidigital number, since it uses as much as digits as its factorization.
4421020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6793.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 4421020031 is about 66490.7514696593. The cubic root of 4421020031 is about 1641.2478148437.
Adding to 4421020031 its reverse (1300201244), we get a palindrome (5721221275).
The spelling of 4421020031 in words is "four billion, four hundred twenty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •