Base | Representation |
---|---|
bin | 11110001011000001110… |
… | …11000100100000000001 |
3 | 10200002221022211000221211 |
4 | 33011200323010200001 |
5 | 113441142040403001 |
6 | 2112132014050121 |
7 | 134620501640131 |
oct | 17054073044001 |
9 | 3602838730854 |
10 | 1036713216001 |
11 | 36a738646521 |
12 | 148b091a9941 |
13 | 769b94153a8 |
14 | 3826a2b8ac1 |
15 | 1be7990b351 |
hex | f160ec4801 |
1036713216001 has 8 divisors (see below), whose sum is σ = 1118407599144. Its totient is φ = 957320083200.
The previous prime is 1036713215981. The next prime is 1036713216037. The reversal of 1036713216001 is 1006123176301.
It can be written as a sum of positive squares in 4 ways, for example, as 370179763776 + 666533452225 = 608424^2 + 816415^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 1036713216001 - 25 = 1036713215969 is a prime.
It is a super-2 number, since 2×10367132160012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1036713216401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 575311650 + ... + 575313451.
It is an arithmetic number, because the mean of its divisors is an integer number (139800949893).
Almost surely, 21036713216001 is an apocalyptic number.
It is an amenable number.
1036713216001 is a deficient number, since it is larger than the sum of its proper divisors (81694383143).
1036713216001 is a wasteful number, since it uses less digits than its factorization.
1036713216001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150625171.
The product of its (nonzero) digits is 4536, while the sum is 31.
The spelling of 1036713216001 in words is "one trillion, thirty-six billion, seven hundred thirteen million, two hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •