Base | Representation |
---|---|
bin | 101100000101111010001… |
… | …001011101101010010101 |
3 | 101201122221222220102101201 |
4 | 230011322021131222111 |
5 | 344120420304313241 |
6 | 10235544030152501 |
7 | 431624153426125 |
oct | 54057211355225 |
9 | 11648858812351 |
10 | 3030001244821 |
11 | a6901a78aa91 |
12 | 40b299352731 |
13 | 18c96023c785 |
14 | a691d586c85 |
15 | 53c3d516931 |
hex | 2c17a25da95 |
3030001244821 has 2 divisors, whose sum is σ = 3030001244822. Its totient is φ = 3030001244820.
The previous prime is 3030001244807. The next prime is 3030001244827. The reversal of 3030001244821 is 1284421000303.
3030001244821 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1995681734596 + 1034319510225 = 1412686^2 + 1017015^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030001244821 - 225 = 3029967690389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3030001244821.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3030001244827) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515000622410 + 1515000622411.
It is an arithmetic number, because the mean of its divisors is an integer number (1515000622411).
Almost surely, 23030001244821 is an apocalyptic number.
It is an amenable number.
3030001244821 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030001244821 is an equidigital number, since it uses as much as digits as its factorization.
3030001244821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
The spelling of 3030001244821 in words is "three trillion, thirty billion, one million, two hundred forty-four thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •