Base | Representation |
---|---|
bin | 1000010111001110… |
… | …01101011101000101 |
3 | 102120220100020102102 |
4 | 10023213031131011 |
5 | 33143341423042 |
6 | 2021303521445 |
7 | 216155426333 |
oct | 41347153505 |
9 | 12526306372 |
10 | 4489795397 |
11 | 19a441080a |
12 | a53759285 |
13 | 567242a89 |
14 | 308410b53 |
15 | 1b4274b32 |
hex | 10b9cd745 |
4489795397 has 4 divisors (see below), whose sum is σ = 4507265676. Its totient is φ = 4472325120.
The previous prime is 4489795333. The next prime is 4489795403. The reversal of 4489795397 is 7935979844.
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 1973669476 + 2516125921 = 44426^2 + 50161^2 .
It is a cyclic number.
It is not a de Polignac number, because 4489795397 - 26 = 4489795333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4489797397) 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, 8734754 + ... + 8735267.
It is an arithmetic number, because the mean of its divisors is an integer number (1126816419).
Almost surely, 24489795397 is an apocalyptic number.
It is an amenable number.
4489795397 is a deficient number, since it is larger than the sum of its proper divisors (17470279).
4489795397 is a wasteful number, since it uses less digits than its factorization.
4489795397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17470278.
The product of its digits is 68584320, while the sum is 65.
The square root of 4489795397 is about 67005.9355355927. The cubic root of 4489795397 is about 1649.7147222743.
The spelling of 4489795397 in words is "four billion, four hundred eighty-nine million, seven hundred ninety-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •