Base | Representation |
---|---|
bin | 10100000001100111… |
… | …11010110000011111 |
3 | 1000202020221211012200 |
4 | 22000303322300133 |
5 | 134004230401010 |
6 | 4534451502543 |
7 | 530264142462 |
oct | 120063726037 |
9 | 30666854180 |
10 | 10751028255 |
11 | 4617747720 |
12 | 21005b7a53 |
13 | 1024484ca6 |
14 | 73dbc12d9 |
15 | 42dcaecc0 |
hex | 280cfac1f |
10751028255 has 48 divisors (see below), whose sum is σ = 20344836096. Its totient is φ = 5208615360.
The previous prime is 10751028251. The next prime is 10751028287. The reversal of 10751028255 is 55282015701.
10751028255 is a `hidden beast` number, since 10 + 7 + 510 + 2 + 82 + 55 = 666.
10751028255 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10751028255 - 22 = 10751028251 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10751028251) 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 47 ways as a sum of consecutive naturals, for example, 696754 + ... + 712016.
It is an arithmetic number, because the mean of its divisors is an integer number (423850752).
Almost surely, 210751028255 is an apocalyptic number.
10751028255 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10751028255 is a deficient number, since it is larger than the sum of its proper divisors (9593807841).
10751028255 is a wasteful number, since it uses less digits than its factorization.
10751028255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16708 (or 16705 counting only the distinct ones).
The product of its (nonzero) digits is 28000, while the sum is 36.
The spelling of 10751028255 in words is "ten billion, seven hundred fifty-one million, twenty-eight thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •