Base | Representation |
---|---|
bin | 1001100111111001011110… |
… | …0111101000111100101001 |
3 | 1101110112112102221011112011 |
4 | 2121332113213220330221 |
5 | 2341324441314413001 |
6 | 34300511052315521 |
7 | 2141312144512105 |
oct | 231762747507451 |
9 | 41415472834464 |
10 | 10581048201001 |
11 | 340a440953513 |
12 | 122a817772ba1 |
13 | 5b9a33623885 |
14 | 2881a83c4905 |
15 | 135386097d51 |
hex | 99f979e8f29 |
10581048201001 has 4 divisors (see below), whose sum is σ = 10945911932100. Its totient is φ = 10216184469904.
The previous prime is 10581048200993. The next prime is 10581048201013. The reversal of 10581048201001 is 10010284018501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2364139955776 + 8216908245225 = 1537576^2 + 2866515^2 .
It is a cyclic number.
It is not a de Polignac number, because 10581048201001 - 23 = 10581048200993 is a prime.
It is a super-2 number, since 2×105810482010012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10581048201301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182431865506 + ... + 182431865563.
It is an arithmetic number, because the mean of its divisors is an integer number (2736477983025).
Almost surely, 210581048201001 is an apocalyptic number.
It is an amenable number.
10581048201001 is a deficient number, since it is larger than the sum of its proper divisors (364863731099).
10581048201001 is an equidigital number, since it uses as much as digits as its factorization.
10581048201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364863731098.
The product of its (nonzero) digits is 2560, while the sum is 31.
The spelling of 10581048201001 in words is "ten trillion, five hundred eighty-one billion, forty-eight million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •