Base | Representation |
---|---|
bin | 1110110101111101111… |
… | …1010111111110001001 |
3 | 220101012202010211120220 |
4 | 3231133133113332021 |
5 | 13134222303140013 |
6 | 313051524540253 |
7 | 24265156563231 |
oct | 3553737277611 |
9 | 811182124526 |
10 | 255005130633 |
11 | 99168825a50 |
12 | 41508851689 |
13 | 1b07bcc5b56 |
14 | c4b144acc1 |
15 | 6977435b23 |
hex | 3b5f7d7f89 |
255005130633 has 8 divisors (see below), whose sum is σ = 370916553696. Its totient is φ = 154548564000.
The previous prime is 255005130613. The next prime is 255005130637. The reversal of 255005130633 is 336031500552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 255005130633 - 28 = 255005130377 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 7727428201 = 255005130633 / (2 + 5 + 5 + 0 + 0 + 5 + 1 + 3 + 0 + 6 + 3 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 255005130594 and 255005130603.
It is not an unprimeable number, because it can be changed into a prime (255005130637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3863714068 + ... + 3863714133.
It is an arithmetic number, because the mean of its divisors is an integer number (46364569212).
Almost surely, 2255005130633 is an apocalyptic number.
It is an amenable number.
255005130633 is a deficient number, since it is larger than the sum of its proper divisors (115911423063).
255005130633 is a wasteful number, since it uses less digits than its factorization.
255005130633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7727428215.
The product of its (nonzero) digits is 40500, while the sum is 33.
The spelling of 255005130633 in words is "two hundred fifty-five billion, five million, one hundred thirty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •