Base | Representation |
---|---|
bin | 1000010011101011… |
… | …1111010101010001 |
3 | 12202102020121002210 |
4 | 2010322333111101 |
5 | 14031343300043 |
6 | 1005141502333 |
7 | 106156110534 |
oct | 20472772521 |
9 | 5672217083 |
10 | 2230056273 |
11 | a44899315 |
12 | 522a119a9 |
13 | 297026133 |
14 | 172262a1b |
15 | d0ba7633 |
hex | 84ebf551 |
2230056273 has 8 divisors (see below), whose sum is σ = 2986393600. Its totient is φ = 1480211568.
The previous prime is 2230056263. The next prime is 2230056313. The reversal of 2230056273 is 3726500322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2230056273 - 210 = 2230055249 is a prime.
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 2230056273.
It is not an unprimeable number, because it can be changed into a prime (2230056203) 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 7 ways as a sum of consecutive naturals, for example, 1622353 + ... + 1623726.
It is an arithmetic number, because the mean of its divisors is an integer number (373299200).
Almost surely, 22230056273 is an apocalyptic number.
It is an amenable number.
2230056273 is a deficient number, since it is larger than the sum of its proper divisors (756337327).
2230056273 is a wasteful number, since it uses less digits than its factorization.
2230056273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3246311.
The product of its (nonzero) digits is 15120, while the sum is 30.
The square root of 2230056273 is about 47223.4716322297. The cubic root of 2230056273 is about 1306.4875455203.
Adding to 2230056273 its reverse (3726500322), we get a palindrome (5956556595).
The spelling of 2230056273 in words is "two billion, two hundred thirty million, fifty-six thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •