Base | Representation |
---|---|
bin | 110100101010111110… |
… | …0001110011110111111 |
3 | 101210221220022012111012 |
4 | 1221111330032132333 |
5 | 3323122404013043 |
6 | 123543521145435 |
7 | 11112665434166 |
oct | 1512574163677 |
9 | 353856265435 |
10 | 113111001023 |
11 | 43a74236239 |
12 | 19b0878b27b |
13 | a887ba7307 |
14 | 56904423dd |
15 | 2e202b5a18 |
hex | 1a55f0e7bf |
113111001023 has 4 divisors (see below), whose sum is σ = 115869805968. Its totient is φ = 110352196080.
The previous prime is 113111001011. The next prime is 113111001067. The reversal of 113111001023 is 320100111311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320100111311 = 499 ⋅641483189.
It is a cyclic number.
It is not a de Polignac number, because 113111001023 - 220 = 113109952447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113111000989 and 113111001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113111081023) 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, 1379402411 + ... + 1379402492.
It is an arithmetic number, because the mean of its divisors is an integer number (28967451492).
Almost surely, 2113111001023 is an apocalyptic number.
113111001023 is a deficient number, since it is larger than the sum of its proper divisors (2758804945).
113111001023 is an equidigital number, since it uses as much as digits as its factorization.
113111001023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2758804944.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 113111001023 its reverse (320100111311), we get a palindrome (433211112334).
The spelling of 113111001023 in words is "one hundred thirteen billion, one hundred eleven million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •