Base | Representation |
---|---|
bin | 10011000111011101… |
… | …01010001010101100 |
3 | 222111020212000121220 |
4 | 21203232222022230 |
5 | 132004324012231 |
6 | 4414222023340 |
7 | 512220666264 |
oct | 114356521254 |
9 | 28436760556 |
10 | 10263110316 |
11 | 4397292758 |
12 | 1ba5117b50 |
13 | c77370354 |
14 | 6d50927a4 |
15 | 401031896 |
hex | 263baa2ac |
10263110316 has 12 divisors (see below), whose sum is σ = 23947257432. Its totient is φ = 3421036768.
The previous prime is 10263110311. The next prime is 10263110339. The reversal of 10263110316 is 61301136201.
10263110316 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (10263110311) 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 3 ways as a sum of consecutive naturals, for example, 427629585 + ... + 427629608.
It is an arithmetic number, because the mean of its divisors is an integer number (1995604786).
Almost surely, 210263110316 is an apocalyptic number.
It is an amenable number.
10263110316 is an abundant number, since it is smaller than the sum of its proper divisors (13684147116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10263110316 is a wasteful number, since it uses less digits than its factorization.
10263110316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855259200 (or 855259198 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 10263110316 its reverse (61301136201), we get a palindrome (71564246517).
The spelling of 10263110316 in words is "ten billion, two hundred sixty-three million, one hundred ten thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •