Base | Representation |
---|---|
bin | 1101100000011110… |
… | …0001011000100001 |
3 | 100100200200021200121 |
4 | 3120013201120201 |
5 | 24411204203101 |
6 | 1355442320241 |
7 | 155565135265 |
oct | 33007413041 |
9 | 10320607617 |
10 | 3625850401 |
11 | 15a0775088 |
12 | 852359081 |
13 | 45a261414 |
14 | 26579c0a5 |
15 | 1634bb0a1 |
hex | d81e1621 |
3625850401 has 2 divisors, whose sum is σ = 3625850402. Its totient is φ = 3625850400.
The previous prime is 3625850377. The next prime is 3625850407. The reversal of 3625850401 is 1040585263.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3624160401 + 1690000 = 60201^2 + 1300^2 .
It is an emirp because it is prime and its reverse (1040585263) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3625850401 - 225 = 3592295969 is a prime.
It is a super-2 number, since 2×36258504012 = 26293582260863721602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3625850407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1812925200 + 1812925201.
It is an arithmetic number, because the mean of its divisors is an integer number (1812925201).
Almost surely, 23625850401 is an apocalyptic number.
It is an amenable number.
3625850401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3625850401 is an equidigital number, since it uses as much as digits as its factorization.
3625850401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 3625850401 is about 60215.0346757353. The cubic root of 3625850401 is about 1536.2785276484.
The spelling of 3625850401 in words is "three billion, six hundred twenty-five million, eight hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •