Base | Representation |
---|---|
bin | 1000011101011101… |
… | …0110011011010010 |
3 | 12212021101001112000 |
4 | 2013113112123102 |
5 | 14122341422310 |
6 | 1013204214430 |
7 | 110164365261 |
oct | 20727263322 |
9 | 5767331460 |
10 | 2271045330 |
11 | a65a44a74 |
12 | 53469a416 |
13 | 2a2677c08 |
14 | 1778925d8 |
15 | d45a24c0 |
hex | 875d66d2 |
2271045330 has 64 divisors (see below), whose sum is σ = 6139134720. Its totient is φ = 597310848.
The previous prime is 2271045269. The next prime is 2271045331. The reversal of 2271045330 is 335401722.
2271045330 is a `hidden beast` number, since 2 + 27 + 104 + 533 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2271045294 and 2271045303.
It is not an unprimeable number, because it can be changed into a prime (2271045331) 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 31 ways as a sum of consecutive naturals, for example, 37902 + ... + 77321.
It is an arithmetic number, because the mean of its divisors is an integer number (95923980).
Almost surely, 22271045330 is an apocalyptic number.
2271045330 is an abundant number, since it is smaller than the sum of its proper divisors (3868089390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2271045330 is a wasteful number, since it uses less digits than its factorization.
2271045330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115312 (or 115306 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 2271045330 is about 47655.4858332176. The cubic root of 2271045330 is about 1314.4435336802.
The spelling of 2271045330 in words is "two billion, two hundred seventy-one million, forty-five thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •