Base | Representation |
---|---|
bin | 1111001010011111… |
… | …1101011000010101 |
3 | 101111200110221100200 |
4 | 3302213331120111 |
5 | 31314030430201 |
6 | 1511530131113 |
7 | 202605125442 |
oct | 36247753025 |
9 | 11450427320 |
10 | 4070561301 |
11 | 17a97a8a54 |
12 | 957280a99 |
13 | 4cb428871 |
14 | 2a88809c9 |
15 | 18c562386 |
hex | f29fd615 |
4070561301 has 6 divisors (see below), whose sum is σ = 5879699670. Its totient is φ = 2713707528.
The previous prime is 4070561251. The next prime is 4070561389. The reversal of 4070561301 is 1031650704.
4070561301 is a `hidden beast` number, since 4 + 0 + 70 + 561 + 30 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2958272100 + 1112289201 = 54390^2 + 33351^2 .
It is not a de Polignac number, because 4070561301 - 214 = 4070544917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4070561801) 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 in 5 ways as a sum of consecutive naturals, for example, 226142286 + ... + 226142303.
It is an arithmetic number, because the mean of its divisors is an integer number (979949945).
Almost surely, 24070561301 is an apocalyptic number.
It is an amenable number.
4070561301 is a deficient number, since it is larger than the sum of its proper divisors (1809138369).
4070561301 is a wasteful number, since it uses less digits than its factorization.
4070561301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452284595 (or 452284592 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 4070561301 is about 63800.9506277140. The cubic root of 4070561301 is about 1596.6807884342.
The spelling of 4070561301 in words is "four billion, seventy million, five hundred sixty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •