Base | Representation |
---|---|
bin | 1101001010100101… |
… | …0011110011110001 |
3 | 100010021221001112101 |
4 | 3102221103303301 |
5 | 24214203410101 |
6 | 1342402500401 |
7 | 153401611306 |
oct | 32251236361 |
9 | 10107831471 |
10 | 3534044401 |
11 | 155396a958 |
12 | 827664701 |
13 | 444229444 |
14 | 2575010ad |
15 | 15a3d4401 |
hex | d2a53cf1 |
3534044401 has 2 divisors, whose sum is σ = 3534044402. Its totient is φ = 3534044400.
The previous prime is 3534044389. The next prime is 3534044411. The reversal of 3534044401 is 1044404353.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3380259600 + 153784801 = 58140^2 + 12401^2 .
It is a cyclic number.
It is not a de Polignac number, because 3534044401 - 215 = 3534011633 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3534044401.
It is not a weakly prime, because it can be changed into another prime (3534044411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1767022200 + 1767022201.
It is an arithmetic number, because the mean of its divisors is an integer number (1767022201).
Almost surely, 23534044401 is an apocalyptic number.
It is an amenable number.
3534044401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3534044401 is an equidigital number, since it uses as much as digits as its factorization.
3534044401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 28.
The square root of 3534044401 is about 59447.8292370714. The cubic root of 3534044401 is about 1523.2014128214.
Adding to 3534044401 its reverse (1044404353), we get a palindrome (4578448754).
The spelling of 3534044401 in words is "three billion, five hundred thirty-four million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •