Base | Representation |
---|---|
bin | 101000011101000111100… |
… | …111001100110101010111 |
3 | 100211202210010200202021212 |
4 | 220131013213030311113 |
5 | 331022013044032111 |
6 | 5525045110532035 |
7 | 404565054101240 |
oct | 50350747146527 |
9 | 10752703622255 |
10 | 2780045299031 |
11 | 982013106380 |
12 | 38a95b66701b |
13 | 172207336880 |
14 | 987aa961cc7 |
15 | 4c4ae50098b |
hex | 287479ccd57 |
2780045299031 has 32 divisors (see below), whose sum is σ = 3733622678016. Its totient is φ = 1999110960000.
The previous prime is 2780045299019. The next prime is 2780045299037. The reversal of 2780045299031 is 1309925400872.
It is not a de Polignac number, because 2780045299031 - 26 = 2780045298967 is a prime.
It is a super-2 number, since 2×27800452990312 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2780045299037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3494261 + ... + 4215441.
It is an arithmetic number, because the mean of its divisors is an integer number (116675708688).
Almost surely, 22780045299031 is an apocalyptic number.
2780045299031 is a deficient number, since it is larger than the sum of its proper divisors (953577378985).
2780045299031 is a wasteful number, since it uses less digits than its factorization.
2780045299031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725063.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 2780045299031 in words is "two trillion, seven hundred eighty billion, forty-five million, two hundred ninety-nine thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •