Base | Representation |
---|---|
bin | 100001000010101110101… |
… | …0110011110101001000001 |
3 | 121002011000020211121022212 |
4 | 1002011131112132221001 |
5 | 1043401134212340013 |
6 | 13354133230311505 |
7 | 646046542143305 |
oct | 102053526365101 |
9 | 17064006747285 |
10 | 4541346605633 |
11 | 14a0a79847922 |
12 | 614187958595 |
13 | 26c329ca1116 |
14 | 119b33903d05 |
15 | 7d1e691e6a8 |
hex | 4215d59ea41 |
4541346605633 has 2 divisors, whose sum is σ = 4541346605634. Its totient is φ = 4541346605632.
The previous prime is 4541346605629. The next prime is 4541346605639. The reversal of 4541346605633 is 3365066431454.
4541346605633 is digitally balanced in base 3, 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., 4490572095409 + 50774510224 = 2119097^2 + 225332^2 .
It is a cyclic number.
It is not a de Polignac number, because 4541346605633 - 22 = 4541346605629 is a prime.
It is not a weakly prime, because it can be changed into another prime (4541346605639) 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, 2270673302816 + 2270673302817.
It is an arithmetic number, because the mean of its divisors is an integer number (2270673302817).
Almost surely, 24541346605633 is an apocalyptic number.
It is an amenable number.
4541346605633 is a deficient number, since it is larger than the sum of its proper divisors (1).
4541346605633 is an equidigital number, since it uses as much as digits as its factorization.
4541346605633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9331200, while the sum is 50.
The spelling of 4541346605633 in words is "four trillion, five hundred forty-one billion, three hundred forty-six million, six hundred five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •