Base | Representation |
---|---|
bin | 100000101010110110100… |
… | …0010001001101101000001 |
3 | 120220020122201001110212222 |
4 | 1001111231002021231001 |
5 | 1042031130421324042 |
6 | 13314413145100425 |
7 | 642253060112126 |
oct | 101255502115501 |
9 | 16806581043788 |
10 | 4490070104897 |
11 | 1481256577993 |
12 | 606257487715 |
13 | 267547933520 |
14 | 11746b84c74d |
15 | 7bbe4e7c2d2 |
hex | 4156d089b41 |
4490070104897 has 4 divisors (see below), whose sum is σ = 4835460112980. Its totient is φ = 4144680096816.
The previous prime is 4490070104881. The next prime is 4490070104903. The reversal of 4490070104897 is 7984010700944.
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 459628405681 + 4030441699216 = 677959^2 + 2007596^2 .
It is a cyclic number.
It is not a de Polignac number, because 4490070104897 - 24 = 4490070104881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4490070104837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172695004022 + ... + 172695004047.
It is an arithmetic number, because the mean of its divisors is an integer number (1208865028245).
Almost surely, 24490070104897 is an apocalyptic number.
It is an amenable number.
4490070104897 is a deficient number, since it is larger than the sum of its proper divisors (345390008083).
4490070104897 is a wasteful number, since it uses less digits than its factorization.
4490070104897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345390008082.
The product of its (nonzero) digits is 2032128, while the sum is 53.
The spelling of 4490070104897 in words is "four trillion, four hundred ninety billion, seventy million, one hundred four thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •