Base | Representation |
---|---|
bin | 110100101110000010… |
… | …1111001111001010111 |
3 | 101211020002111022211112 |
4 | 1221130011321321113 |
5 | 3323330313421211 |
6 | 124002045125235 |
7 | 11115360556052 |
oct | 1513405717127 |
9 | 354202438745 |
10 | 113214201431 |
11 | 44017513231 |
12 | 19b3725981b |
13 | a8a339b746 |
14 | 56a0027a99 |
15 | 2e2939d88b |
hex | 1a5c179e57 |
113214201431 has 8 divisors (see below), whose sum is σ = 114577318800. Its totient is φ = 111853107520.
The previous prime is 113214201427. The next prime is 113214201433. The reversal of 113214201431 is 134102412311.
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 113214201431 - 22 = 113214201427 is a prime.
It is a super-2 number, since 2×1132142014312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113214201397 and 113214201406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113214201433) 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, 393140 + ... + 617241.
It is an arithmetic number, because the mean of its divisors is an integer number (14322164850).
Almost surely, 2113214201431 is an apocalyptic number.
113214201431 is a deficient number, since it is larger than the sum of its proper divisors (1363117369).
113214201431 is a wasteful number, since it uses less digits than its factorization.
113214201431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011729.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 113214201431 its reverse (134102412311), we get a palindrome (247316613742).
The spelling of 113214201431 in words is "one hundred thirteen billion, two hundred fourteen million, two hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •