Base | Representation |
---|---|
bin | 110100110100100101… |
… | …1111011011010100011 |
3 | 101211210101212101002221 |
4 | 1221221023323122203 |
5 | 3324303033244243 |
6 | 124035533451511 |
7 | 11123666052004 |
oct | 1515113733243 |
9 | 354711771087 |
10 | 113433884323 |
11 | 4411a51a241 |
12 | 19b98940b97 |
13 | a909a57a16 |
14 | 56c12911ab |
15 | 2e3d7e4bed |
hex | 1a692fb6a3 |
113433884323 has 4 divisors (see below), whose sum is σ = 113435197128. Its totient is φ = 113432571520.
The previous prime is 113433884297. The next prime is 113433884339. The reversal of 113433884323 is 323488334311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323488334311 = 197 ⋅1642072763.
It is a cyclic number.
It is not a de Polignac number, because 113433884323 - 29 = 113433883811 is a prime.
It is a super-2 number, since 2×1134338843232 (a number of 23 digits) contains 22 as substring.
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 113433884323.
It is not an unprimeable number, because it can be changed into a prime (113433884423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 516913 + ... + 702898.
It is an arithmetic number, because the mean of its divisors is an integer number (28358799282).
Almost surely, 2113433884323 is an apocalyptic number.
113433884323 is a deficient number, since it is larger than the sum of its proper divisors (1312805).
113433884323 is an equidigital number, since it uses as much as digits as its factorization.
113433884323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312804.
The product of its digits is 497664, while the sum is 43.
The spelling of 113433884323 in words is "one hundred thirteen billion, four hundred thirty-three million, eight hundred eighty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •