Base | Representation |
---|---|
bin | 1001010101011001… |
… | …0010111111000000 |
3 | 20110121211012210000 |
4 | 2111112102333000 |
5 | 20112421300422 |
6 | 1052344440000 |
7 | 116043450240 |
oct | 22526227700 |
9 | 6417735700 |
10 | 2505650112 |
11 | 1076413019 |
12 | 59b179000 |
13 | 30c15a104 |
14 | 19aac1b20 |
15 | e9e94cac |
hex | 95592fc0 |
2505650112 has 280 divisors, whose sum is σ = 8785006560. Its totient is φ = 690923520.
The previous prime is 2505650093. The next prime is 2505650149. The reversal of 2505650112 is 2110565052.
2505650112 is a `hidden beast` number, since 2 + 5 + 0 + 5 + 650 + 1 + 1 + 2 = 666.
It is a super-2 number, since 2×25056501122 = 12556564967531225088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1051162 + ... + 1053542.
Almost surely, 22505650112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2505650112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4392503280).
2505650112 is an abundant number, since it is smaller than the sum of its proper divisors (6279356448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2505650112 is a wasteful number, since it uses less digits than its factorization.
2505650112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2441 (or 2422 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 2505650112 is about 50056.4692322581. The cubic root of 2505650112 is about 1358.2304899047.
The spelling of 2505650112 in words is "two billion, five hundred five million, six hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •