Base | Representation |
---|---|
bin | 110100101011110111… |
… | …0110100110001111101 |
3 | 101211000222211110101010 |
4 | 1221113232310301331 |
5 | 3323203101323201 |
6 | 123550513105433 |
7 | 11113511664120 |
oct | 1512756646175 |
9 | 354028743333 |
10 | 113141042301 |
11 | 43a8a194741 |
12 | 19b16858279 |
13 | a891195011 |
14 | 56944223b7 |
15 | 2e22c4bbd6 |
hex | 1a57bb4c7d |
113141042301 has 16 divisors (see below), whose sum is σ = 172433408000. Its totient is φ = 64641520368.
The previous prime is 113141042237. The next prime is 113141042317. The reversal of 113141042301 is 103240141311.
It is not a de Polignac number, because 113141042301 - 26 = 113141042237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113141040301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 304381 + ... + 564738.
It is an arithmetic number, because the mean of its divisors is an integer number (10777088000).
Almost surely, 2113141042301 is an apocalyptic number.
It is an amenable number.
113141042301 is a deficient number, since it is larger than the sum of its proper divisors (59292365699).
113141042301 is an equidigital number, since it uses as much as digits as its factorization.
113141042301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875328.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 113141042301 its reverse (103240141311), we get a palindrome (216381183612).
It can be divided in two parts, 1131410 and 42301, that added together give a palindrome (1173711).
The spelling of 113141042301 in words is "one hundred thirteen billion, one hundred forty-one million, forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •