Base | Representation |
---|---|
bin | 11001101111011011001101… |
… | …111000110010001111111100 |
3 | 112211211210022122100100201212 |
4 | 121233123031320302033330 |
5 | 104314313443231000012 |
6 | 1040440014322023552 |
7 | 32563111230154256 |
oct | 3157331570621774 |
9 | 484753278310655 |
10 | 113210202203132 |
11 | 330881a483a301 |
12 | 10844a8b7a7bb8 |
13 | 4b228a39869c8 |
14 | 1dd558dc74cd6 |
15 | d14cccdcab22 |
hex | 66f6cde323fc |
113210202203132 has 24 divisors (see below), whose sum is σ = 206866704331392. Its totient is φ = 54108644554800.
The previous prime is 113210202203093. The next prime is 113210202203141. The reversal of 113210202203132 is 231302202012311.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 113210202203098 and 113210202203107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401735594 + ... + 402017297.
It is an arithmetic number, because the mean of its divisors is an integer number (8619446013808).
Almost surely, 2113210202203132 is an apocalyptic number.
It is an amenable number.
113210202203132 is a deficient number, since it is larger than the sum of its proper divisors (93656502128260).
113210202203132 is a wasteful number, since it uses less digits than its factorization.
113210202203132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803754449 (or 803754447 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 113210202203132 its reverse (231302202012311), we get a palindrome (344512404215443).
The spelling of 113210202203132 in words is "one hundred thirteen trillion, two hundred ten billion, two hundred two million, two hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •