Base | Representation |
---|---|
bin | 1011000101000100… |
… | …0011000111011101 |
3 | 21200021011201000222 |
4 | 2301101003013131 |
5 | 22042323131240 |
6 | 1211035531125 |
7 | 133461615122 |
oct | 26121030735 |
9 | 7607151028 |
10 | 2974036445 |
11 | 1296847666 |
12 | 6abbb9aa5 |
13 | 3851c38a3 |
14 | 202da8749 |
15 | 126165eb5 |
hex | b14431dd |
2974036445 has 8 divisors (see below), whose sum is σ = 3569253336. Its totient is φ = 2378956096.
The previous prime is 2974036421. The next prime is 2974036447. The reversal of 2974036445 is 5446304792.
It can be written as a sum of positive squares in 4 ways, for example, as 336392281 + 2637644164 = 18341^2 + 51358^2 .
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 2974036445 - 26 = 2974036381 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2974036396 and 2974036405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2974036447) 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, 22259 + ... + 80271.
It is an arithmetic number, because the mean of its divisors is an integer number (446156667).
Almost surely, 22974036445 is an apocalyptic number.
It is an amenable number.
2974036445 is a deficient number, since it is larger than the sum of its proper divisors (595216891).
2974036445 is a wasteful number, since it uses less digits than its factorization.
2974036445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68271.
The product of its (nonzero) digits is 725760, while the sum is 44.
The square root of 2974036445 is about 54534.7269636513. The cubic root of 2974036445 is about 1438.0768509811.
The spelling of 2974036445 in words is "two billion, nine hundred seventy-four million, thirty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •