Base | Representation |
---|---|
bin | 111101011010000… |
… | …0000000111101011 |
3 | 12022121002211020022 |
4 | 1322310000013223 |
5 | 13204433433311 |
6 | 540242351055 |
7 | 102026361440 |
oct | 17264000753 |
9 | 5277084208 |
10 | 2060452331 |
11 | 968087373 |
12 | 49605b48b |
13 | 26ab52182 |
14 | 1579139c7 |
15 | c0d545db |
hex | 7ad001eb |
2060452331 has 4 divisors (see below), whose sum is σ = 2354802672. Its totient is φ = 1766101992.
The previous prime is 2060452307. The next prime is 2060452351. The reversal of 2060452331 is 1332540602.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2060452331 - 214 = 2060435947 is a prime.
It is a super-2 number, since 2×20604523312 = 8490927616646667122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2060452331.
It is not an unprimeable number, because it can be changed into a prime (2060452351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147175160 + ... + 147175173.
It is an arithmetic number, because the mean of its divisors is an integer number (588700668).
Almost surely, 22060452331 is an apocalyptic number.
2060452331 is a deficient number, since it is larger than the sum of its proper divisors (294350341).
2060452331 is an equidigital number, since it uses as much as digits as its factorization.
2060452331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294350340.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 2060452331 is about 45392.2056194673. The cubic root of 2060452331 is about 1272.4894503933.
Adding to 2060452331 its reverse (1332540602), we get a palindrome (3392992933).
The spelling of 2060452331 in words is "two billion, sixty million, four hundred fifty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •