Base | Representation |
---|---|
bin | 101111111110100010… |
… | …1011010010110101011 |
3 | 100211221100200122021200 |
4 | 1133331011122112223 |
5 | 3142001224131443 |
6 | 115155332535243 |
7 | 10305121055400 |
oct | 1377505322653 |
9 | 324840618250 |
10 | 103030302123 |
11 | 3a770a12a21 |
12 | 17b74781523 |
13 | 993c573618 |
14 | 4db56b42a7 |
15 | 2a302b6dd3 |
hex | 17fd15a5ab |
103030302123 has 72 divisors (see below), whose sum is σ = 178864358400. Its totient is φ = 56923987680.
The previous prime is 103030302047. The next prime is 103030302127. The reversal of 103030302123 is 321203030301.
It is not a de Polignac number, because 103030302123 - 29 = 103030301611 is a prime.
It is a super-3 number, since 3×1030303021233 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103030302096 and 103030302105.
It is not an unprimeable number, because it can be changed into a prime (103030302127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 19123036 + ... + 19128422.
It is an arithmetic number, because the mean of its divisors is an integer number (2484227200).
Almost surely, 2103030302123 is an apocalyptic number.
103030302123 is a deficient number, since it is larger than the sum of its proper divisors (75834056277).
103030302123 is a wasteful number, since it uses less digits than its factorization.
103030302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6837 (or 6827 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 103030302123 its reverse (321203030301), we get a palindrome (424233332424).
The spelling of 103030302123 in words is "one hundred three billion, thirty million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •