Base | Representation |
---|---|
bin | 100101011011110… |
… | …0010010011010001 |
3 | 10020112112002102001 |
4 | 1022313202103101 |
5 | 10033023304101 |
6 | 324345554001 |
7 | 43061303443 |
oct | 11267422321 |
9 | 3215462361 |
10 | 1256072401 |
11 | 595024871 |
12 | 2b07a5901 |
13 | 1702c780c |
14 | bcb68493 |
15 | 75414901 |
hex | 4ade24d1 |
1256072401 has 2 divisors, whose sum is σ = 1256072402. Its totient is φ = 1256072400.
The previous prime is 1256072393. The next prime is 1256072407. The reversal of 1256072401 is 1042706521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1113890625 + 142181776 = 33375^2 + 11924^2 .
It is an emirp because it is prime and its reverse (1042706521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1256072401 - 23 = 1256072393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1256072401.
It is not a weakly prime, because it can be changed into another prime (1256072407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 628036200 + 628036201.
It is an arithmetic number, because the mean of its divisors is an integer number (628036201).
Almost surely, 21256072401 is an apocalyptic number.
It is an amenable number.
1256072401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1256072401 is an equidigital number, since it uses as much as digits as its factorization.
1256072401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 1256072401 is about 35441.1117348201. Note that the first 3 decimals coincide. The cubic root of 1256072401 is about 1078.9588734993.
Adding to 1256072401 its reverse (1042706521), we get a palindrome (2298778922).
The spelling of 1256072401 in words is "one billion, two hundred fifty-six million, seventy-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •