Base | Representation |
---|---|
bin | 110100101011110101… |
… | …1110001001110111111 |
3 | 101211000221022202200000 |
4 | 1221113223301032333 |
5 | 3323202400210333 |
6 | 123550444005343 |
7 | 11113502120013 |
oct | 1512753611677 |
9 | 354027282600 |
10 | 113140241343 |
11 | 43a89797998 |
12 | 19b16530853 |
13 | a890c7458c |
14 | 5694294543 |
15 | 2e22b3e713 |
hex | 1a57af13bf |
113140241343 has 12 divisors (see below), whose sum is σ = 169477563528. Its totient is φ = 75426827400.
The previous prime is 113140241341. The next prime is 113140241353. The reversal of 113140241343 is 343142041311.
113140241343 is a `hidden beast` number, since 1 + 1 + 314 + 0 + 2 + 4 + 1 + 343 = 666.
It is not a de Polignac number, because 113140241343 - 21 = 113140241341 is a prime.
It is a super-2 number, since 2×1131402413432 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113140241341) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 232798608 + ... + 232799093.
It is an arithmetic number, because the mean of its divisors is an integer number (14123130294).
Almost surely, 2113140241343 is an apocalyptic number.
113140241343 is a deficient number, since it is larger than the sum of its proper divisors (56337322185).
113140241343 is an frugal number, since it uses more digits than its factorization.
113140241343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465597716 (or 465597704 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 113140241343 its reverse (343142041311), we get a palindrome (456282282654).
The spelling of 113140241343 in words is "one hundred thirteen billion, one hundred forty million, two hundred forty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •