Base | Representation |
---|---|
bin | 10010110100100010… |
… | …11011000000110011 |
3 | 222002012022022010111 |
4 | 21122101123000303 |
5 | 131143214413443 |
6 | 4350353242151 |
7 | 505253263114 |
oct | 113221330063 |
9 | 28065268114 |
10 | 10104451123 |
11 | 4315776758 |
12 | 1b5bb63357 |
13 | c5052bc80 |
14 | 6bbd9220b |
15 | 3e214169d |
hex | 25a45b033 |
10104451123 has 16 divisors (see below), whose sum is σ = 11615788800. Its totient is φ = 8711811360.
The previous prime is 10104451111. The next prime is 10104451129. The reversal of 10104451123 is 32115440101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104451123 is a prime.
It is a super-5 number, since 5×101044511235 (a number of 51 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10104451094 and 10104451103.
It is not an unprimeable number, because it can be changed into a prime (10104451129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 270553 + ... + 305626.
It is an arithmetic number, because the mean of its divisors is an integer number (725986800).
Almost surely, 210104451123 is an apocalyptic number.
10104451123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10104451123 is a deficient number, since it is larger than the sum of its proper divisors (1511337677).
10104451123 is a wasteful number, since it uses less digits than its factorization.
10104451123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576282.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10104451123 its reverse (32115440101), we get a palindrome (42219891224).
The spelling of 10104451123 in words is "ten billion, one hundred four million, four hundred fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •