Base | Representation |
---|---|
bin | 10011001100011111… |
… | …01010010110100111 |
3 | 222121012021022022010 |
4 | 21212033222112213 |
5 | 132101130110023 |
6 | 4422330405303 |
7 | 513242512554 |
oct | 114617522647 |
9 | 28535238263 |
10 | 10305316263 |
11 | 440909a700 |
12 | 1bb7290833 |
13 | c83029c98 |
14 | 6da91ba2b |
15 | 404abc093 |
hex | 2663ea5a7 |
10305316263 has 24 divisors (see below), whose sum is σ = 15169762944. Its totient is φ = 6218082640.
The previous prime is 10305316223. The next prime is 10305316277. The reversal of 10305316263 is 36261350301.
It is a happy number.
It is not a de Polignac number, because 10305316263 - 29 = 10305315751 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10305316263.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10305316223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19870 + ... + 144932.
It is an arithmetic number, because the mean of its divisors is an integer number (632073456).
Almost surely, 210305316263 is an apocalyptic number.
10305316263 is a deficient number, since it is larger than the sum of its proper divisors (4864446681).
10305316263 is a wasteful number, since it uses less digits than its factorization.
10305316263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125315 (or 125304 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 10305316263 its reverse (36261350301), we get a palindrome (46566666564).
It can be divided in two parts, 103053 and 16263, that added together give a triangular number (119316 = T488).
The spelling of 10305316263 in words is "ten billion, three hundred five million, three hundred sixteen thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •