Base | Representation |
---|---|
bin | 10001101010010010000… |
… | …100011001010000110101 |
3 | 11022000121001121010121111 |
4 | 101222102010121100311 |
5 | 124341004114344221 |
6 | 2325311244515021 |
7 | 153452626500640 |
oct | 21522204312065 |
9 | 4260531533544 |
10 | 1213631403061 |
11 | 428775318a60 |
12 | 17726284ba71 |
13 | 8a5a272ba8c |
14 | 42a50a92a57 |
15 | 218817aebe1 |
hex | 11a92119435 |
1213631403061 has 32 divisors (see below), whose sum is σ = 1602776678400. Its totient is φ = 889684857600.
The previous prime is 1213631403059. The next prime is 1213631403077. The reversal of 1213631403061 is 1603041363121.
It is not a de Polignac number, because 1213631403061 - 21 = 1213631403059 is a prime.
It is a super-2 number, since 2×12136314030612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213631401061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2947056 + ... + 3333526.
It is an arithmetic number, because the mean of its divisors is an integer number (50086771200).
Almost surely, 21213631403061 is an apocalyptic number.
1213631403061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1213631403061 is a deficient number, since it is larger than the sum of its proper divisors (389145275339).
1213631403061 is a wasteful number, since it uses less digits than its factorization.
1213631403061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388905.
The product of its (nonzero) digits is 7776, while the sum is 31.
Adding to 1213631403061 its reverse (1603041363121), we get a palindrome (2816672766182).
The spelling of 1213631403061 in words is "one trillion, two hundred thirteen billion, six hundred thirty-one million, four hundred three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •