Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …000101010011110111101 |
3 | 10220100110100112020222020 |
4 | 100002110120222132331 |
5 | 121023344241334323 |
6 | 2202130300310353 |
7 | 142421420656116 |
oct | 20022430523675 |
9 | 3810410466866 |
10 | 1102001121213 |
11 | 3953a09a3a83 |
12 | 1596a9b423b9 |
13 | 7cbc2555a75 |
14 | 3b4a117520d |
15 | 1d9eb4d5ae3 |
hex | 1009462a7bd |
1102001121213 has 4 divisors (see below), whose sum is σ = 1469334828288. Its totient is φ = 734667414140.
The previous prime is 1102001121181. The next prime is 1102001121229. The reversal of 1102001121213 is 3121211002011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1102001121213 - 25 = 1102001121181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102001121192 and 1102001121201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102001121233) 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, 183666853533 + ... + 183666853538.
It is an arithmetic number, because the mean of its divisors is an integer number (367333707072).
Almost surely, 21102001121213 is an apocalyptic number.
It is an amenable number.
1102001121213 is a deficient number, since it is larger than the sum of its proper divisors (367333707075).
1102001121213 is an equidigital number, since it uses as much as digits as its factorization.
1102001121213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367333707074.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1102001121213 its reverse (3121211002011), we get a palindrome (4223212123224).
The spelling of 1102001121213 in words is "one trillion, one hundred two billion, one million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •