Base | Representation |
---|---|
bin | 110100101101101000… |
… | …1011010111111010111 |
3 | 101211012010121100022000 |
4 | 1221123101122333113 |
5 | 3323313303141401 |
6 | 124000434210343 |
7 | 11115132615042 |
oct | 1513321327727 |
9 | 354163540260 |
10 | 113200443351 |
11 | 4400a776616 |
12 | 19b327239b3 |
13 | a8a0592478 |
14 | 569c285c59 |
15 | 2e28082186 |
hex | 1a5b45afd7 |
113200443351 has 32 divisors (see below), whose sum is σ = 168685440000. Its totient is φ = 75026106144.
The previous prime is 113200443341. The next prime is 113200443371. The reversal of 113200443351 is 153344002311.
It is a happy number.
113200443351 is a `hidden beast` number, since 1 + 1 + 320 + 0 + 4 + 4 + 335 + 1 = 666.
It is not a de Polignac number, because 113200443351 - 26 = 113200443287 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200443341) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 7079001 + ... + 7094973.
It is an arithmetic number, because the mean of its divisors is an integer number (5271420000).
Almost surely, 2113200443351 is an apocalyptic number.
113200443351 is a deficient number, since it is larger than the sum of its proper divisors (55484996649).
113200443351 is a wasteful number, since it uses less digits than its factorization.
113200443351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17500 (or 17494 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 113200443351 its reverse (153344002311), we get a palindrome (266544445662).
The spelling of 113200443351 in words is "one hundred thirteen billion, two hundred million, four hundred forty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •