Base | Representation |
---|---|
bin | 1011000001000100110100… |
… | …1110000010111001010111 |
3 | 1120220000000222220011112012 |
4 | 2300101031032002321113 |
5 | 3041430113421132411 |
6 | 41432403254214435 |
7 | 2360066664143231 |
oct | 260211516027127 |
9 | 46800028804465 |
10 | 12113103302231 |
11 | 39501580318a8 |
12 | 143772595441b |
13 | 69b350acc8a9 |
14 | 2dc3c4db9251 |
15 | 1601526b518b |
hex | b044d382e57 |
12113103302231 has 16 divisors (see below), whose sum is σ = 12961011439200. Its totient is φ = 11286271987200.
The previous prime is 12113103302227. The next prime is 12113103302297. The reversal of 12113103302231 is 13220330131121.
It is a cyclic number.
It is not a de Polignac number, because 12113103302231 - 22 = 12113103302227 is a prime.
It is a super-2 number, since 2×121131033022312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12113103302197 and 12113103302206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12113103302221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10690211 + ... + 11768891.
It is an arithmetic number, because the mean of its divisors is an integer number (810063214950).
Almost surely, 212113103302231 is an apocalyptic number.
12113103302231 is a deficient number, since it is larger than the sum of its proper divisors (847908136969).
12113103302231 is a wasteful number, since it uses less digits than its factorization.
12113103302231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1088450.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12113103302231 its reverse (13220330131121), we get a palindrome (25333433433352).
The spelling of 12113103302231 in words is "twelve trillion, one hundred thirteen billion, one hundred three million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •