Base | Representation |
---|---|
bin | 110100101000010110… |
… | …0101001101110010101 |
3 | 101210201202202220222010 |
4 | 1221100230221232111 |
5 | 3322432344012323 |
6 | 123531055454433 |
7 | 11110546631310 |
oct | 1512054515625 |
9 | 353652686863 |
10 | 113023032213 |
11 | 43a29611a43 |
12 | 19aa3227419 |
13 | a8728b6a70 |
14 | 56828a3977 |
15 | 2e176dac93 |
hex | 1a50b29b95 |
113023032213 has 32 divisors (see below), whose sum is σ = 185556028672. Its totient is φ = 59590080000.
The previous prime is 113023032197. The next prime is 113023032251. The reversal of 113023032213 is 312230320311.
It is not a de Polignac number, because 113023032213 - 24 = 113023032197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 113023032213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113023032253) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 531963 + ... + 713463.
It is an arithmetic number, because the mean of its divisors is an integer number (5798625896).
Almost surely, 2113023032213 is an apocalyptic number.
113023032213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113023032213 is a deficient number, since it is larger than the sum of its proper divisors (72532996459).
113023032213 is a wasteful number, since it uses less digits than its factorization.
113023032213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183805.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 113023032213 its reverse (312230320311), we get a palindrome (425253352524).
The spelling of 113023032213 in words is "one hundred thirteen billion, twenty-three million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •