Base | Representation |
---|---|
bin | 1000010101101101… |
… | …01101100101000001 |
3 | 102120000102022210221 |
4 | 10022312231211001 |
5 | 33132113110141 |
6 | 2020131223041 |
7 | 215642365654 |
oct | 41266554501 |
9 | 12500368727 |
10 | 4477081921 |
11 | 1998217a04 |
12 | a4b447a81 |
13 | 564711100 |
14 | 30686189b |
15 | 1b30b2bd1 |
hex | 10adad941 |
4477081921 has 9 divisors (see below), whose sum is σ = 4848906531. Its totient is φ = 4131888072.
The previous prime is 4477081913. The next prime is 4477081933. The reversal of 4477081921 is 1291807744.
The square root of 4477081921 is 66911.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 662290225 + 3814791696 = 25735^2 + 61764^2 .
It is not a de Polignac number, because 4477081921 - 23 = 4477081913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4477081421) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 867270 + ... + 872416.
Almost surely, 24477081921 is an apocalyptic number.
4477081921 is the 66911-st square number.
4477081921 is the 33456-th centered octagonal number.
It is an amenable number.
4477081921 is a deficient number, since it is larger than the sum of its proper divisors (371824610).
4477081921 is an frugal number, since it uses more digits than its factorization.
4477081921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10320 (or 5160 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 43.
The cubic root of 4477081921 is about 1648.1561184902.
Multiplying 4477081921 by its product of nonzero digits (112896), we get a square (505444640553216 = 224820962).
The spelling of 4477081921 in words is "four billion, four hundred seventy-seven million, eighty-one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •