Base | Representation |
---|---|
bin | 1111001010100001… |
… | …1110011101100101 |
3 | 101111200201211020100 |
4 | 3302220132131211 |
5 | 31314044244210 |
6 | 1511533054313 |
7 | 202606231500 |
oct | 36250363545 |
9 | 11450654210 |
10 | 4070696805 |
11 | 17a989083a |
12 | 957327399 |
13 | 4cb475446 |
14 | 2a88b8137 |
15 | 18c58c5c0 |
hex | f2a1e765 |
4070696805 has 36 divisors (see below), whose sum is σ = 8207858412. Its totient is φ = 1860888960.
The previous prime is 4070696783. The next prime is 4070696813. The reversal of 4070696805 is 5086960704.
It can be written as a sum of positive squares in 2 ways, for example, as 725925249 + 3344771556 = 26943^2 + 57834^2 .
It is not a de Polignac number, because 4070696805 - 26 = 4070696741 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 920856 + ... + 925265.
It is an arithmetic number, because the mean of its divisors is an integer number (227996067).
Almost surely, 24070696805 is an apocalyptic number.
4070696805 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4070696805 is an abundant number, since it is smaller than the sum of its proper divisors (4137161607).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4070696805 is a wasteful number, since it uses less digits than its factorization.
4070696805 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1846146 (or 1846136 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 4070696805 is about 63802.0125466274. The cubic root of 4070696805 is about 1596.6985054202.
The spelling of 4070696805 in words is "four billion, seventy million, six hundred ninety-six thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •