Base | Representation |
---|---|
bin | 111101011011011… |
… | …1110000011000010 |
3 | 12022122120100101000 |
4 | 1322312332003002 |
5 | 13210133332044 |
6 | 540311152430 |
7 | 102036111465 |
oct | 17266760302 |
9 | 5278510330 |
10 | 2061230274 |
11 | 9685688a4 |
12 | 496375716 |
13 | 26b0652ac |
14 | 157a772dc |
15 | c0e59d69 |
hex | 7adbe0c2 |
2061230274 has 32 divisors (see below), whose sum is σ = 4738464000. Its totient is φ = 663383952.
The previous prime is 2061230273. The next prime is 2061230293. The reversal of 2061230274 is 4720321602.
2061230274 is a `hidden beast` number, since 20 + 612 + 3 + 0 + 27 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2061230273) 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 15 ways as a sum of consecutive naturals, for example, 656554 + ... + 659685.
It is an arithmetic number, because the mean of its divisors is an integer number (148077000).
Almost surely, 22061230274 is an apocalyptic number.
2061230274 is an abundant number, since it is smaller than the sum of its proper divisors (2677233726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2061230274 is a wasteful number, since it uses less digits than its factorization.
2061230274 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316279 (or 1316273 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 2061230274 is about 45400.7739361346. The cubic root of 2061230274 is about 1272.6495769970.
Adding to 2061230274 its reverse (4720321602), we get a palindrome (6781551876).
The spelling of 2061230274 in words is "two billion, sixty-one million, two hundred thirty thousand, two hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •