Base | Representation |
---|---|
bin | 1011000110111001001010… |
… | …0101111100000000110001 |
3 | 1121020120000112221200211000 |
4 | 2301232102211330000301 |
5 | 3100044312132104301 |
6 | 41550333125512213 |
7 | 2400235541253342 |
oct | 261562245740061 |
9 | 47216015850730 |
10 | 12213051441201 |
11 | 3989587165a46 |
12 | 1452b7a272669 |
13 | 6a78bb951b20 |
14 | 3031871ba0c9 |
15 | 162a520a8786 |
hex | b1b9297c031 |
12213051441201 has 128 divisors (see below), whose sum is σ = 20721120537600. Its totient is φ = 7056320624640.
The previous prime is 12213051441167. The next prime is 12213051441281. The reversal of 12213051441201 is 10214415031221.
12213051441201 is a `hidden beast` number, since 1 + 2 + 2 + 13 + 0 + 5 + 1 + 441 + 201 = 666.
It is not a de Polignac number, because 12213051441201 - 215 = 12213051408433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12213051441281) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 52642011 + ... + 52873503.
It is an arithmetic number, because the mean of its divisors is an integer number (161883754200).
Almost surely, 212213051441201 is an apocalyptic number.
It is an amenable number.
12213051441201 is a deficient number, since it is larger than the sum of its proper divisors (8508069096399).
12213051441201 is a wasteful number, since it uses less digits than its factorization.
12213051441201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 231688 (or 231682 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 12213051441201 its reverse (10214415031221), we get a palindrome (22427466472422).
The spelling of 12213051441201 in words is "twelve trillion, two hundred thirteen billion, fifty-one million, four hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •