Base | Representation |
---|---|
bin | 11001110000110001110111… |
… | …011000101100100100101010 |
3 | 112212011200110121210212220122 |
4 | 121300301313120230210222 |
5 | 104322330013444344320 |
6 | 1040550442345523242 |
7 | 32602613626306451 |
oct | 3160616730544452 |
9 | 485150417725818 |
10 | 113303240231210 |
11 | 331136a83348a7 |
12 | 1085ab15aa3522 |
13 | 4b2b5b0016623 |
14 | 1dd9c98437b98 |
15 | d17425d0dd25 |
hex | 670c7762c92a |
113303240231210 has 16 divisors (see below), whose sum is σ = 203990963241600. Its totient is φ = 45311267020176.
The previous prime is 113303240231171. The next prime is 113303240231231. The reversal of 113303240231210 is 12132042303311.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 113303240231210.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1253586590 + ... + 1253676969.
It is an arithmetic number, because the mean of its divisors is an integer number (12749435202600).
Almost surely, 2113303240231210 is an apocalyptic number.
113303240231210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113303240231210 is a deficient number, since it is larger than the sum of its proper divisors (90687723010390).
113303240231210 is a wasteful number, since it uses less digits than its factorization.
113303240231210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2507268085.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 113303240231210 its reverse (12132042303311), we get a palindrome (125435282534521).
The spelling of 113303240231210 in words is "one hundred thirteen trillion, three hundred three billion, two hundred forty million, two hundred thirty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •