Base | Representation |
---|---|
bin | 1011111011110011101000… |
… | …0111000010010010110011 |
3 | 1201110110102201012210221222 |
4 | 2332330322013002102303 |
5 | 3204443030100342321 |
6 | 43524113131335255 |
7 | 2523016604521361 |
oct | 276747207022263 |
9 | 51413381183858 |
10 | 13122100012211 |
11 | 41aa0624010a3 |
12 | 157b1988b152b |
13 | 742540c66058 |
14 | 33518221c631 |
15 | 17b508ba83ab |
hex | bef3a1c24b3 |
13122100012211 has 8 divisors (see below), whose sum is σ = 13556863026048. Its totient is φ = 12688053840000.
The previous prime is 13122100012171. The next prime is 13122100012243. The reversal of 13122100012211 is 11221000122131.
It is a happy number.
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 13122100012211 - 210 = 13122100011187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13122100012211.
It is not an unprimeable number, because it can be changed into a prime (13122100012261) 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, 179173190 + ... + 179246411.
It is an arithmetic number, because the mean of its divisors is an integer number (1694607878256).
Almost surely, 213122100012211 is an apocalyptic number.
13122100012211 is a deficient number, since it is larger than the sum of its proper divisors (434763013837).
13122100012211 is a wasteful number, since it uses less digits than its factorization.
13122100012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358420813.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 13122100012211 its reverse (11221000122131), we get a palindrome (24343100134342).
The spelling of 13122100012211 in words is "thirteen trillion, one hundred twenty-two billion, one hundred million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •