Base | Representation |
---|---|
bin | 10000011100101011111… |
… | …001111111011100011101 |
3 | 11000001112110100210111010 |
4 | 100130223321333130131 |
5 | 122004340113134323 |
6 | 2223131510445433 |
7 | 144443132104455 |
oct | 20345371773435 |
9 | 4001473323433 |
10 | 1130313021213 |
11 | 3a63aa262542 |
12 | 16308b663879 |
13 | 82784c79c0c |
14 | 3c9c9314d65 |
15 | 1e606d0bc93 |
hex | 1072be7f71d |
1130313021213 has 8 divisors (see below), whose sum is σ = 1507100175648. Its totient is φ = 753533940464.
The previous prime is 1130313021161. The next prime is 1130313021217. The reversal of 1130313021213 is 3121203130311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1130313021213 - 28 = 1130313020957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1130313021213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130313021217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1683831 + ... + 2257412.
It is an arithmetic number, because the mean of its divisors is an integer number (188387521956).
Almost surely, 21130313021213 is an apocalyptic number.
It is an amenable number.
1130313021213 is a deficient number, since it is larger than the sum of its proper divisors (376787154435).
1130313021213 is an equidigital number, since it uses as much as digits as its factorization.
1130313021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4036843.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1130313021213 its reverse (3121203130311), we get a palindrome (4251516151524).
The spelling of 1130313021213 in words is "one trillion, one hundred thirty billion, three hundred thirteen million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •