Base | Representation |
---|---|
bin | 110100101110010011… |
… | …1100010111001100011 |
3 | 101211020201002100211001 |
4 | 1221130213202321203 |
5 | 3323340043121011 |
6 | 124003002132431 |
7 | 11115525535414 |
oct | 1513447427143 |
9 | 354221070731 |
10 | 113223020131 |
11 | 44021496911 |
12 | 19b3a1b1117 |
13 | a8a5168700 |
14 | 56a128180b |
15 | 2e2a0417c1 |
hex | 1a5c9e2e63 |
113223020131 has 6 divisors (see below), whose sum is σ = 122602442100. Its totient is φ = 104513556888.
The previous prime is 113223020129. The next prime is 113223020143. The reversal of 113223020131 is 131020322311.
It is not a de Polignac number, because 113223020131 - 21 = 113223020129 is a prime.
It is a super-3 number, since 3×1132230201313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113223020099 and 113223020108.
It is not an unprimeable number, because it can be changed into a prime (113223020111) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 334979181 + ... + 334979518.
It is an arithmetic number, because the mean of its divisors is an integer number (20433740350).
Almost surely, 2113223020131 is an apocalyptic number.
113223020131 is a deficient number, since it is larger than the sum of its proper divisors (9379421969).
113223020131 is an equidigital number, since it uses as much as digits as its factorization.
113223020131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 669958725 (or 669958712 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113223020131 its reverse (131020322311), we get a palindrome (244243342442).
The spelling of 113223020131 in words is "one hundred thirteen billion, two hundred twenty-three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •