Base | Representation |
---|---|
bin | 10011001000010111… |
… | …10111000011110100 |
3 | 222111210020221021211 |
4 | 21210023313003310 |
5 | 132013303442200 |
6 | 4415054051204 |
7 | 512343031105 |
oct | 114413670364 |
9 | 28453227254 |
10 | 10270765300 |
11 | 43a0640a94 |
12 | 1ba77a9b04 |
13 | c78b20723 |
14 | 6d60c63ac |
15 | 401a44aba |
hex | 2642f70f4 |
10270765300 has 18 divisors (see below), whose sum is σ = 22287560918. Its totient is φ = 4108306080.
The previous prime is 10270765223. The next prime is 10270765303. The reversal of 10270765300 is 356707201.
10270765300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 37015056 + 10233750244 = 6084^2 + 101162^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10270765303) 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 5 ways as a sum of consecutive naturals, for example, 51353727 + ... + 51353926.
Almost surely, 210270765300 is an apocalyptic number.
10270765300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10270765300 is an abundant number, since it is smaller than the sum of its proper divisors (12016795618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10270765300 is a wasteful number, since it uses less digits than its factorization.
10270765300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102707667 (or 102707660 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 31.
The spelling of 10270765300 in words is "ten billion, two hundred seventy million, seven hundred sixty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •