Base | Representation |
---|---|
bin | 1101100100110010010… |
… | …1110000011011100110 |
3 | 211021222000210001202201 |
4 | 3121030211300123212 |
5 | 12310110034400402 |
6 | 255045304125114 |
7 | 22564145331121 |
oct | 3311445603346 |
9 | 737860701681 |
10 | 233213200102 |
11 | 8a9a5854003 |
12 | 3924676679a |
13 | 18cb82c50bc |
14 | b40518d3b8 |
15 | 60ee207687 |
hex | 364c9706e6 |
233213200102 has 4 divisors (see below), whose sum is σ = 349819800156. Its totient is φ = 116606600050.
The previous prime is 233213200093. The next prime is 233213200109. The reversal of 233213200102 is 201002312332.
233213200102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 233213200102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233213200109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58303300024 + ... + 58303300027.
It is an arithmetic number, because the mean of its divisors is an integer number (87454950039).
Almost surely, 2233213200102 is an apocalyptic number.
233213200102 is a deficient number, since it is larger than the sum of its proper divisors (116606600054).
233213200102 is a wasteful number, since it uses less digits than its factorization.
233213200102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116606600053.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 233213200102 its reverse (201002312332), we get a palindrome (434215512434).
The spelling of 233213200102 in words is "two hundred thirty-three billion, two hundred thirteen million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •