Base | Representation |
---|---|
bin | 10011001000111000… |
… | …11011001110100110 |
3 | 222112002102120000022 |
4 | 21210130123032212 |
5 | 132020411422000 |
6 | 4415331115142 |
7 | 512424655235 |
oct | 114434331646 |
9 | 28462376008 |
10 | 10275107750 |
11 | 43a3037596 |
12 | 1ba9142ab2 |
13 | c799b111b |
14 | 6d68d6b1c |
15 | 402101585 |
hex | 26471b3a6 |
10275107750 has 16 divisors (see below), whose sum is σ = 19235002176. Its totient is φ = 4110043000.
The previous prime is 10275107749. The next prime is 10275107767. The reversal of 10275107750 is 5770157201.
It is a happy number.
10275107750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102751077502 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10275107750.
It is a congruent number.
It is an unprimeable number.
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, 20549966 + ... + 20550465.
It is an arithmetic number, because the mean of its divisors is an integer number (1202187636).
Almost surely, 210275107750 is an apocalyptic number.
10275107750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10275107750 is a deficient number, since it is larger than the sum of its proper divisors (8959894426).
10275107750 is an equidigital number, since it uses as much as digits as its factorization.
10275107750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41100448 (or 41100438 counting only the distinct ones).
The product of its (nonzero) digits is 17150, while the sum is 35.
The spelling of 10275107750 in words is "ten billion, two hundred seventy-five million, one hundred seven thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •