Base | Representation |
---|---|
bin | 101100011100011101011… |
… | …010001111000010110001 |
3 | 101210222110111122222011011 |
4 | 230130131122033002301 |
5 | 400020013040222311 |
6 | 10255030450350521 |
7 | 433442204355664 |
oct | 54343532170261 |
9 | 11728414588134 |
10 | 3054215164081 |
11 | a78315922a04 |
12 | 413b1658b441 |
13 | 19201b957853 |
14 | a7b793896db |
15 | 546a91b1321 |
hex | 2c71d68f0b1 |
3054215164081 has 2 divisors, whose sum is σ = 3054215164082. Its totient is φ = 3054215164080.
The previous prime is 3054215164069. The next prime is 3054215164123. The reversal of 3054215164081 is 1804615124503.
3054215164081 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2333271525025 + 720943639056 = 1527505^2 + 849084^2 .
It is a cyclic number.
It is not a de Polignac number, because 3054215164081 - 27 = 3054215163953 is a prime.
It is a super-2 number, since 2×30542151640812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3054215164031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1527107582040 + 1527107582041.
It is an arithmetic number, because the mean of its divisors is an integer number (1527107582041).
Almost surely, 23054215164081 is an apocalyptic number.
It is an amenable number.
3054215164081 is a deficient number, since it is larger than the sum of its proper divisors (1).
3054215164081 is an equidigital number, since it uses as much as digits as its factorization.
3054215164081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 40.
The spelling of 3054215164081 in words is "three trillion, fifty-four billion, two hundred fifteen million, one hundred sixty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •