Base | Representation |
---|---|
bin | 10010110110110001… |
… | …01000001011100100 |
3 | 222010111102122021210 |
4 | 21123120220023210 |
5 | 131213004223114 |
6 | 4352301311420 |
7 | 505601035320 |
oct | 113330501344 |
9 | 28114378253 |
10 | 10123117284 |
11 | 4325265935 |
12 | 1b66265570 |
13 | c54366237 |
14 | 6c0650980 |
15 | 3e3acc259 |
hex | 25b6282e4 |
10123117284 has 96 divisors (see below), whose sum is σ = 27317799936. Its totient is φ = 2857852800.
The previous prime is 10123117283. The next prime is 10123117309. The reversal of 10123117284 is 48271132101.
It is not an unprimeable number, because it can be changed into a prime (10123117283) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5793699 + ... + 5795445.
It is an arithmetic number, because the mean of its divisors is an integer number (284560416).
Almost surely, 210123117284 is an apocalyptic number.
10123117284 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10123117284, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13658899968).
10123117284 is an abundant number, since it is smaller than the sum of its proper divisors (17194682652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10123117284 is a wasteful number, since it uses less digits than its factorization.
10123117284 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2545 (or 2543 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 30.
Adding to 10123117284 its reverse (48271132101), we get a palindrome (58394249385).
The spelling of 10123117284 in words is "ten billion, one hundred twenty-three million, one hundred seventeen thousand, two hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •