Base | Representation |
---|---|
bin | 10011000111000110… |
… | …01011010010110011 |
3 | 222111001012002121220 |
4 | 21203203023102303 |
5 | 132003041202100 |
6 | 4414033320123 |
7 | 512153261535 |
oct | 114343132263 |
9 | 28431162556 |
10 | 10260100275 |
11 | 4395617217 |
12 | 1ba4106043 |
13 | c76858269 |
14 | 6d490b855 |
15 | 400b39aa0 |
hex | 2638cb4b3 |
10260100275 has 24 divisors (see below), whose sum is σ = 17216558784. Its totient is φ = 5390378400.
The previous prime is 10260100271. The next prime is 10260100303. The reversal of 10260100275 is 57200106201.
10260100275 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 10260100275 - 22 = 10260100271 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10260100271) 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 23 ways as a sum of consecutive naturals, for example, 1015881 + ... + 1025930.
It is an arithmetic number, because the mean of its divisors is an integer number (717356616).
Almost surely, 210260100275 is an apocalyptic number.
10260100275 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10260100275 is a deficient number, since it is larger than the sum of its proper divisors (6956458509).
10260100275 is a wasteful number, since it uses less digits than its factorization.
10260100275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041891 (or 2041886 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
Adding to 10260100275 its reverse (57200106201), we get a palindrome (67460206476).
The spelling of 10260100275 in words is "ten billion, two hundred sixty million, one hundred thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •