Base | Representation |
---|---|
bin | 1001111110110000… |
… | …1110000000010001 |
3 | 20220201022220000000 |
4 | 2133230032000101 |
5 | 20441331402131 |
6 | 1121503520213 |
7 | 123251363313 |
oct | 23754160021 |
9 | 6821286000 |
10 | 2679169041 |
11 | 115535939a |
12 | 6292b9069 |
13 | 3390a2033 |
14 | 1b5b6d7b3 |
15 | 10a31cce6 |
hex | 9fb0e011 |
2679169041 has 32 divisors (see below), whose sum is σ = 4056048000. Its totient is φ = 1769420052.
The previous prime is 2679169019. The next prime is 2679169049. The reversal of 2679169041 is 1409619762.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is an ABA number since it can be written as A⋅BA, here for A=3, B=963.
It is not a de Polignac number, because 2679169041 - 29 = 2679168529 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (2679169049) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25038910 + ... + 25039016.
It is an arithmetic number, because the mean of its divisors is an integer number (126751500).
Almost surely, 22679169041 is an apocalyptic number.
It is an amenable number.
2679169041 is a deficient number, since it is larger than the sum of its proper divisors (1376878959).
2679169041 is an frugal number, since it uses more digits than its factorization.
2679169041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 342 (or 110 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 45.
The square root of 2679169041 is about 51760.6901132510. The cubic root of 2679169041 is about 1388.8863362060.
The spelling of 2679169041 in words is "two billion, six hundred seventy-nine million, one hundred sixty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •