Base | Representation |
---|---|
bin | 11111001001001001011… |
… | …11111011101111011001 |
3 | 10210022000120002000110211 |
4 | 33210210233323233121 |
5 | 120012442212330240 |
6 | 2135325204211121 |
7 | 140211111562006 |
oct | 17444457735731 |
9 | 3708016060424 |
10 | 1070063401945 |
11 | 3828a199186a |
12 | 153476099aa1 |
13 | 79ba28b1725 |
14 | 39b116448ad |
15 | 1cc7c6ecbea |
hex | f924bfbbd9 |
1070063401945 has 8 divisors (see below), whose sum is σ = 1318780841544. Its totient is φ = 832914215424.
The previous prime is 1070063401937. The next prime is 1070063401987. The reversal of 1070063401945 is 5491043600701.
It can be written as a sum of positive squares in 4 ways, for example, as 134463756249 + 935599645696 = 366693^2 + 967264^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1070063401945 - 23 = 1070063401937 is a prime.
It is a super-2 number, since 2×10700634019452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1070063401898 and 1070063401907.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2892063064 + ... + 2892063433.
It is an arithmetic number, because the mean of its divisors is an integer number (164847605193).
Almost surely, 21070063401945 is an apocalyptic number.
It is an amenable number.
1070063401945 is a deficient number, since it is larger than the sum of its proper divisors (248717439599).
1070063401945 is an equidigital number, since it uses as much as digits as its factorization.
1070063401945 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5784126539.
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 1070063401945 in words is "one trillion, seventy billion, sixty-three million, four hundred one thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •