Base | Representation |
---|---|
bin | 110101000001101100101000… |
… | …001111110010101110110110 |
3 | 1010120201221210020012000010020 |
4 | 311001230220033302232312 |
5 | 221031430414213342402 |
6 | 2144000342055510010 |
7 | 100060043064043302 |
oct | 6501545017625666 |
9 | 1116657706160106 |
10 | 233213104434102 |
11 | 68344138666601 |
12 | 221a6318988306 |
13 | a018b944559c0 |
14 | 418380853ad02 |
15 | 1be661c2118bc |
hex | d41b283f2bb6 |
233213104434102 has 128 divisors (see below), whose sum is σ = 520286875250688. Its totient is φ = 69205058726400.
The previous prime is 233213104434083. The next prime is 233213104434119. The reversal of 233213104434102 is 201434401312332.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2928779613 + ... + 2928859239.
It is an arithmetic number, because the mean of its divisors is an integer number (4064741212896).
Almost surely, 2233213104434102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 233213104434102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260143437625344).
233213104434102 is an abundant number, since it is smaller than the sum of its proper divisors (287073770816586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233213104434102 is a wasteful number, since it uses less digits than its factorization.
233213104434102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83814.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 233213104434102 its reverse (201434401312332), we get a palindrome (434647505746434).
The spelling of 233213104434102 in words is "two hundred thirty-three trillion, two hundred thirteen billion, one hundred four million, four hundred thirty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •