Base | Representation |
---|---|
bin | 111001010100101011… |
… | …0011000011110100101 |
3 | 102202202001221020020121 |
4 | 1302221112120132211 |
5 | 4004102134114341 |
6 | 132315042401541 |
7 | 11615353203322 |
oct | 1625126303645 |
9 | 382661836217 |
10 | 123100301221 |
11 | 4822aa02337 |
12 | 1ba360602b1 |
13 | b7ba5b9531 |
14 | 5d5adbbb49 |
15 | 330725d4d1 |
hex | 1ca95987a5 |
123100301221 has 2 divisors, whose sum is σ = 123100301222. Its totient is φ = 123100301220.
The previous prime is 123100301131. The next prime is 123100301273. The reversal of 123100301221 is 122103001321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97303444225 + 25796856996 = 311935^2 + 160614^2 .
It is a cyclic number.
It is not a de Polignac number, because 123100301221 - 233 = 114510366629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123100301195 and 123100301204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123100305221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61550150610 + 61550150611.
It is an arithmetic number, because the mean of its divisors is an integer number (61550150611).
Almost surely, 2123100301221 is an apocalyptic number.
It is an amenable number.
123100301221 is a deficient number, since it is larger than the sum of its proper divisors (1).
123100301221 is an equidigital number, since it uses as much as digits as its factorization.
123100301221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 123100301221 its reverse (122103001321), we get a palindrome (245203302542).
The spelling of 123100301221 in words is "one hundred twenty-three billion, one hundred million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •