Base | Representation |
---|---|
bin | 10111001100101110111101… |
… | …101110100101001000101001 |
3 | 111101020222121021101000001011 |
4 | 113030232331232211020221 |
5 | 101333130202043033113 |
6 | 1000555554544223521 |
7 | 30330301523613631 |
oct | 2714567556451051 |
9 | 441228537330034 |
10 | 102030131221033 |
11 | 2a567810177324 |
12 | b53a15860aba1 |
13 | 44c1527cc7892 |
14 | 1b2a3db3076c1 |
15 | bbe087b9663d |
hex | 5ccbbdba5229 |
102030131221033 has 2 divisors, whose sum is σ = 102030131221034. Its totient is φ = 102030131221032.
The previous prime is 102030131220967. The next prime is 102030131221189. The reversal of 102030131221033 is 330122131030201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89740703546649 + 12289427674384 = 9473157^2 + 3505628^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102030131221033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102030131220995 and 102030131221013.
It is not a weakly prime, because it can be changed into another prime (102030131221633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51015065610516 + 51015065610517.
It is an arithmetic number, because the mean of its divisors is an integer number (51015065610517).
Almost surely, 2102030131221033 is an apocalyptic number.
It is an amenable number.
102030131221033 is a deficient number, since it is larger than the sum of its proper divisors (1).
102030131221033 is an equidigital number, since it uses as much as digits as its factorization.
102030131221033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102030131221033 its reverse (330122131030201), we get a palindrome (432152262251234).
The spelling of 102030131221033 in words is "one hundred two trillion, thirty billion, one hundred thirty-one million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •