Base | Representation |
---|---|
bin | 11001110001001100000000… |
… | …000100110100010001000101 |
3 | 112212021100220101102121012202 |
4 | 121301030000010310101011 |
5 | 104323310002121132323 |
6 | 1041011403150524245 |
7 | 32604626226421133 |
oct | 3161140004642105 |
9 | 485240811377182 |
10 | 113331303302213 |
11 | 3312459919a467 |
12 | 10864448206685 |
13 | 4b31133018099 |
14 | 1ddb39b524753 |
15 | d18019882d28 |
hex | 671300134445 |
113331303302213 has 8 divisors (see below), whose sum is σ = 115750091567232. Its totient is φ = 110912826868096.
The previous prime is 113331303302171. The next prime is 113331303302233. The reversal of 113331303302213 is 312203303133311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113331303302213 - 226 = 113331236193349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113331303302233) 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, 77223020 + ... + 78676917.
It is an arithmetic number, because the mean of its divisors is an integer number (14468761445904).
Almost surely, 2113331303302213 is an apocalyptic number.
It is an amenable number.
113331303302213 is a deficient number, since it is larger than the sum of its proper divisors (2418788265019).
113331303302213 is a wasteful number, since it uses less digits than its factorization.
113331303302213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155915451.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 113331303302213 its reverse (312203303133311), we get a palindrome (425534606435524).
The spelling of 113331303302213 in words is "one hundred thirteen trillion, three hundred thirty-one billion, three hundred three million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •