Base | Representation |
---|---|
bin | 1000011011110111… |
… | …0101010011111100 |
3 | 12211210210012121110 |
4 | 2012331311103330 |
5 | 14114133343332 |
6 | 1012405002020 |
7 | 110053465155 |
oct | 20675652374 |
9 | 5753705543 |
10 | 2264356092 |
11 | a62196279 |
12 | 5323b3310 |
13 | 2a117529b |
14 | 176a3092c |
15 | d3bd04cc |
hex | 86f754fc |
2264356092 has 48 divisors (see below), whose sum is σ = 5413427712. Its totient is φ = 736270080.
The previous prime is 2264356057. The next prime is 2264356093. The reversal of 2264356092 is 2906534622.
It is a super-2 number, since 2×22643560922 = 10254617022755024928, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2264356092.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2264356093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 467668 + ... + 472484.
It is an arithmetic number, because the mean of its divisors is an integer number (112779744).
Almost surely, 22264356092 is an apocalyptic number.
It is an amenable number.
2264356092 is an abundant number, since it is smaller than the sum of its proper divisors (3149071620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2264356092 is a wasteful number, since it uses less digits than its factorization.
2264356092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5778 (or 5776 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The square root of 2264356092 is about 47585.2507821489. The cubic root of 2264356092 is about 1313.1517243677.
The spelling of 2264356092 in words is "two billion, two hundred sixty-four million, three hundred fifty-six thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •