Base | Representation |
---|---|
bin | 11101111110101101101… |
… | …11010111101111010001 |
3 | 10122110212120200122021021 |
4 | 32333112313113233101 |
5 | 113334122104214441 |
6 | 2105120005155441 |
7 | 134264613504253 |
oct | 16772667275721 |
9 | 3573776618237 |
10 | 1030102023121 |
11 | 367955812456 |
12 | 1477830bbb81 |
13 | 761a4832242 |
14 | 37c0024bcd3 |
15 | 1bbde2e43d1 |
hex | efd6dd7bd1 |
1030102023121 has 2 divisors, whose sum is σ = 1030102023122. Its totient is φ = 1030102023120.
The previous prime is 1030102023113. The next prime is 1030102023143. The reversal of 1030102023121 is 1213202010301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017233616400 + 12868406721 = 1008580^2 + 113439^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030102023121 - 23 = 1030102023113 is a prime.
It is a super-2 number, since 2×10301020231212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030102023095 and 1030102023104.
It is not a weakly prime, because it can be changed into another prime (1030103023121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515051011560 + 515051011561.
It is an arithmetic number, because the mean of its divisors is an integer number (515051011561).
Almost surely, 21030102023121 is an apocalyptic number.
It is an amenable number.
1030102023121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030102023121 is an equidigital number, since it uses as much as digits as its factorization.
1030102023121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1030102023121 its reverse (1213202010301), we get a palindrome (2243304033422).
The spelling of 1030102023121 in words is "one trillion, thirty billion, one hundred two million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •