Base | Representation |
---|---|
bin | 11000001101101111… |
… | …00001111110000001 |
3 | 1020120000000122010221 |
4 | 30012313201332001 |
5 | 203111012402431 |
6 | 5545553423041 |
7 | 640104134011 |
oct | 140667417601 |
9 | 36500018127 |
10 | 13000122241 |
11 | 5571259287 |
12 | 262986aa81 |
13 | 12c2415532 |
14 | 8b479bc41 |
15 | 511478111 |
hex | 306de1f81 |
13000122241 has 16 divisors (see below), whose sum is σ = 13820771664. Its totient is φ = 12185800704.
The previous prime is 13000122203. The next prime is 13000122251. The reversal of 13000122241 is 14222100031.
13000122241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 116964225 + 12883158016 = 10815^2 + 113504^2 .
It is a cyclic number.
It is not a de Polignac number, because 13000122241 - 211 = 13000120193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13000122251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5571111 + ... + 5573443.
It is an arithmetic number, because the mean of its divisors is an integer number (863798229).
Almost surely, 213000122241 is an apocalyptic number.
It is an amenable number.
13000122241 is a deficient number, since it is larger than the sum of its proper divisors (820649423).
13000122241 is a wasteful number, since it uses less digits than its factorization.
13000122241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3540.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 13000122241 its reverse (14222100031), we get a palindrome (27222222272).
The spelling of 13000122241 in words is "thirteen billion, one hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •