Base | Representation |
---|---|
bin | 11101111110101101101… |
… | …11010010110101001111 |
3 | 10122110212120122121200220 |
4 | 32333112313102311033 |
5 | 113334122103044043 |
6 | 2105120004522423 |
7 | 134264613361542 |
oct | 16772667226517 |
9 | 3573776577626 |
10 | 1030102003023 |
11 | 3679557a9345 |
12 | 1477830b0413 |
13 | 761a4826052 |
14 | 37c00244859 |
15 | 1bbde2dd483 |
hex | efd6dd2d4f |
1030102003023 has 4 divisors (see below), whose sum is σ = 1373469337368. Its totient is φ = 686734668680.
The previous prime is 1030102003013. The next prime is 1030102003027. The reversal of 1030102003023 is 3203002010301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1030102003023 - 25 = 1030102002991 is a prime.
It is a super-2 number, since 2×10301020030232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030102002993 and 1030102003011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030102003027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 171683667168 + ... + 171683667173.
It is an arithmetic number, because the mean of its divisors is an integer number (343367334342).
Almost surely, 21030102003023 is an apocalyptic number.
1030102003023 is a deficient number, since it is larger than the sum of its proper divisors (343367334345).
1030102003023 is an equidigital number, since it uses as much as digits as its factorization.
1030102003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343367334344.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1030102003023 its reverse (3203002010301), we get a palindrome (4233104013324).
The spelling of 1030102003023 in words is "one trillion, thirty billion, one hundred two million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •