Base | Representation |
---|---|
bin | 110100101000010000… |
… | …1001101000011101101 |
3 | 101210201120010110100222 |
4 | 1221100201031003231 |
5 | 3322431111444323 |
6 | 123530511301125 |
7 | 11110512262115 |
oct | 1512041150355 |
9 | 353646113328 |
10 | 113020031213 |
11 | 43a27952281 |
12 | 19aa221a7a5 |
13 | a8720a5b1b |
14 | 5682322045 |
15 | 2e172e69c8 |
hex | 1a5084d0ed |
113020031213 has 4 divisors (see below), whose sum is σ = 113147450400. Its totient is φ = 112892612028.
The previous prime is 113020031183. The next prime is 113020031279. The reversal of 113020031213 is 312130020311.
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 113020031213 - 212 = 113020027117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113020031191 and 113020031200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113020051213) 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, 63708263 + ... + 63710036.
It is an arithmetic number, because the mean of its divisors is an integer number (28286862600).
Almost surely, 2113020031213 is an apocalyptic number.
It is an amenable number.
113020031213 is a deficient number, since it is larger than the sum of its proper divisors (127419187).
113020031213 is an equidigital number, since it uses as much as digits as its factorization.
113020031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127419186.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113020031213 its reverse (312130020311), we get a palindrome (425150051524).
The spelling of 113020031213 in words is "one hundred thirteen billion, twenty million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •