Base | Representation |
---|---|
bin | 1000111000001000010… |
… | …00111000001100101101 |
3 | 1002011021211002210220011 |
4 | 10130010020320030231 |
5 | 14444131100123341 |
6 | 352042020053221 |
7 | 31015325123263 |
oct | 4340410701455 |
9 | 1064254083804 |
10 | 305012114221 |
11 | 10839a428961 |
12 | 4b143b34211 |
13 | 229bb33c479 |
14 | 10a96a78433 |
15 | 7e02709b81 |
hex | 470423832d |
305012114221 has 2 divisors, whose sum is σ = 305012114222. Its totient is φ = 305012114220.
The previous prime is 305012114213. The next prime is 305012114263. The reversal of 305012114221 is 122411210503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 280359660100 + 24652454121 = 529490^2 + 157011^2 .
It is an emirp because it is prime and its reverse (122411210503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 305012114221 - 23 = 305012114213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 305012114192 and 305012114201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (305012114321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152506057110 + 152506057111.
It is an arithmetic number, because the mean of its divisors is an integer number (152506057111).
Almost surely, 2305012114221 is an apocalyptic number.
It is an amenable number.
305012114221 is a deficient number, since it is larger than the sum of its proper divisors (1).
305012114221 is an equidigital number, since it uses as much as digits as its factorization.
305012114221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 305012114221 its reverse (122411210503), we get a palindrome (427423324724).
The spelling of 305012114221 in words is "three hundred five billion, twelve million, one hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •