Base | Representation |
---|---|
bin | 1001010101010110… |
… | …0101010101011101 |
3 | 20110121110201021212 |
4 | 2111111211111131 |
5 | 20112344310013 |
6 | 1052340434205 |
7 | 116042041145 |
oct | 22525452535 |
9 | 6417421255 |
10 | 2505463133 |
11 | 10762a5598 |
12 | 59b0a8965 |
13 | 30c0c2c84 |
14 | 19aa73925 |
15 | e9e596a8 |
hex | 9556555d |
2505463133 has 8 divisors (see below), whose sum is σ = 2520576000. Its totient is φ = 2490375888.
The previous prime is 2505463127. The next prime is 2505463141. The reversal of 2505463133 is 3313645052.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2505463133 - 216 = 2505397597 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 2505463133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2505463153) 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, 211748 + ... + 223266.
It is an arithmetic number, because the mean of its divisors is an integer number (315072000).
Almost surely, 22505463133 is an apocalyptic number.
It is an amenable number.
2505463133 is a deficient number, since it is larger than the sum of its proper divisors (15112867).
2505463133 is a wasteful number, since it uses less digits than its factorization.
2505463133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12811.
The product of its (nonzero) digits is 32400, while the sum is 32.
The square root of 2505463133 is about 50054.6015167437. The cubic root of 2505463133 is about 1358.1967040096.
The spelling of 2505463133 in words is "two billion, five hundred five million, four hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •