Base | Representation |
---|---|
bin | 10111011011010100000011… |
… | …100100010011011010111001 |
3 | 111111210202200100021020202011 |
4 | 113123110003210103122321 |
5 | 102001034044224441441 |
6 | 1003044132235005521 |
7 | 30462550521435451 |
oct | 2733240344233271 |
9 | 444722610236664 |
10 | 103032030312121 |
11 | 2a913703087489 |
12 | b68036a5998a1 |
13 | 4564b56869351 |
14 | 1b62ac3a5cd61 |
15 | bda175edb581 |
hex | 5db5039136b9 |
103032030312121 has 2 divisors, whose sum is σ = 103032030312122. Its totient is φ = 103032030312120.
The previous prime is 103032030312077. The next prime is 103032030312241. The reversal of 103032030312121 is 121213030230301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96380459196025 + 6651571116096 = 9817355^2 + 2579064^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103032030312121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103032030312092 and 103032030312101.
It is not a weakly prime, because it can be changed into another prime (103032030316121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51516015156060 + 51516015156061.
It is an arithmetic number, because the mean of its divisors is an integer number (51516015156061).
Almost surely, 2103032030312121 is an apocalyptic number.
It is an amenable number.
103032030312121 is a deficient number, since it is larger than the sum of its proper divisors (1).
103032030312121 is an equidigital number, since it uses as much as digits as its factorization.
103032030312121 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 103032030312121 its reverse (121213030230301), we get a palindrome (224245060542422).
The spelling of 103032030312121 in words is "one hundred three trillion, thirty-two billion, thirty million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •