Base | Representation |
---|---|
bin | 1000000010001011… |
… | …1011110001000110 |
3 | 12120022002201202120 |
4 | 2000202323301012 |
5 | 13404100010400 |
6 | 554000150410 |
7 | 104305102053 |
oct | 20042736106 |
9 | 5508081676 |
10 | 2156641350 |
11 | a07405626 |
12 | 502308406 |
13 | 284a60156 |
14 | 1665d202a |
15 | c9504ca0 |
hex | 808bbc46 |
2156641350 has 48 divisors (see below), whose sum is σ = 5472869952. Its totient is φ = 561728160.
The previous prime is 2156641349. The next prime is 2156641351. The reversal of 2156641350 is 531466512.
It is an interprime number because it is at equal distance from previous prime (2156641349) and next prime (2156641351).
It is a super-2 number, since 2×21566413502 = 9302203825059645000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2156641351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 160732 + ... + 173631.
It is an arithmetic number, because the mean of its divisors is an integer number (114018124).
Almost surely, 22156641350 is an apocalyptic number.
2156641350 is an abundant number, since it is smaller than the sum of its proper divisors (3316228602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2156641350 is a wasteful number, since it uses less digits than its factorization.
2156641350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334421 (or 334416 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 2156641350 is about 46439.6527764797. The cubic root of 2156641350 is about 1291.9904671855.
The spelling of 2156641350 in words is "two billion, one hundred fifty-six million, six hundred forty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •