Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1000100001010110011 |
3 | 101211110021210100220110 |
4 | 1221201121010022303 |
5 | 3324021044012243 |
6 | 124014542512403 |
7 | 11120520355464 |
oct | 1514131041263 |
9 | 354407710813 |
10 | 113303110323 |
11 | 44062719857 |
12 | 19b60b95703 |
13 | a8b892ab60 |
14 | 56abb6cd6b |
15 | 2e320b1e33 |
hex | 1a616442b3 |
113303110323 has 8 divisors (see below), whose sum is σ = 162691645648. Its totient is φ = 69724990944.
The previous prime is 113303110321. The next prime is 113303110351. The reversal of 113303110323 is 323011303311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113303110323 - 21 = 113303110321 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113303110323.
It is not an unprimeable number, because it can be changed into a prime (113303110321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1452603940 + ... + 1452604017.
It is an arithmetic number, because the mean of its divisors is an integer number (20336455706).
Almost surely, 2113303110323 is an apocalyptic number.
113303110323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113303110323 is a deficient number, since it is larger than the sum of its proper divisors (49388535325).
113303110323 is a wasteful number, since it uses less digits than its factorization.
113303110323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2905207973.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 113303110323 its reverse (323011303311), we get a palindrome (436314413634).
The spelling of 113303110323 in words is "one hundred thirteen billion, three hundred three million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •