Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …001000000101011100011 |
3 | 10220100110100200212200120 |
4 | 100002110121000223203 |
5 | 121023344302242011 |
6 | 2202130302251323 |
7 | 142421421515151 |
oct | 20022431005343 |
9 | 3810410625616 |
10 | 1102001212131 |
11 | 3953a0a56316 |
12 | 1596a9b86b43 |
13 | 7cbc2588271 |
14 | 3b4a119a3d1 |
15 | 1d9eb502a06 |
hex | 10094640ae3 |
1102001212131 has 4 divisors (see below), whose sum is σ = 1469334949512. Its totient is φ = 734667474752.
The previous prime is 1102001212097. The next prime is 1102001212133. The reversal of 1102001212131 is 1312121002011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1102001212131 - 213 = 1102001203939 is a prime.
It is a super-2 number, since 2×11020012121312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1102001212131.
It is not an unprimeable number, because it can be changed into a prime (1102001212133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 183666868686 + ... + 183666868691.
It is an arithmetic number, because the mean of its divisors is an integer number (367333737378).
Almost surely, 21102001212131 is an apocalyptic number.
1102001212131 is a deficient number, since it is larger than the sum of its proper divisors (367333737381).
1102001212131 is an equidigital number, since it uses as much as digits as its factorization.
1102001212131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367333737380.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1102001212131 its reverse (1312121002011), we get a palindrome (2414122214142).
The spelling of 1102001212131 in words is "one trillion, one hundred two billion, one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •