Base | Representation |
---|---|
bin | 1110110110001000101… |
… | …1000010001010000011 |
3 | 220101022212211001012000 |
4 | 3231202023002022003 |
5 | 13134320313130201 |
6 | 313100213235043 |
7 | 24266244222663 |
oct | 3554213021203 |
9 | 811285731160 |
10 | 255050130051 |
11 | 99191170752 |
12 | 4151b932a83 |
13 | 1b088420122 |
14 | c4b74021a3 |
15 | 697b373d86 |
hex | 3b622c2283 |
255050130051 has 8 divisors (see below), whose sum is σ = 377852044560. Its totient is φ = 170033420016.
The previous prime is 255050130043. The next prime is 255050130077. The reversal of 255050130051 is 150031050552.
255050130051 is a `hidden beast` number, since 2 + 550 + 50 + 13 + 0 + 0 + 51 = 666.
It is not a de Polignac number, because 255050130051 - 23 = 255050130043 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 9446301113 = 255050130051 / (2 + 5 + 5 + 0 + 5 + 0 + 1 + 3 + 0 + 0 + 5 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 255050129997 and 255050130024.
It is not an unprimeable number, because it can be changed into a prime (255050130091) 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, 4723150530 + ... + 4723150583.
It is an arithmetic number, because the mean of its divisors is an integer number (47231505570).
Almost surely, 2255050130051 is an apocalyptic number.
255050130051 is a deficient number, since it is larger than the sum of its proper divisors (122801914509).
255050130051 is an equidigital number, since it uses as much as digits as its factorization.
255050130051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9446301122 (or 9446301116 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 255050130051 in words is "two hundred fifty-five billion, fifty million, one hundred thirty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •