Base | Representation |
---|---|
bin | 1101011101010010111… |
… | …0110010100001010001 |
3 | 211002202212220212012110 |
4 | 3113110232302201101 |
5 | 12242000242131113 |
6 | 254113551415533 |
7 | 22463260066413 |
oct | 3272456624121 |
9 | 732685825173 |
10 | 231202302033 |
11 | 8a06374357a |
12 | 389852245a9 |
13 | 18a578034a1 |
14 | b2940989b3 |
15 | 60328e0bc3 |
hex | 35d4bb2851 |
231202302033 has 32 divisors (see below), whose sum is σ = 312607152000. Its totient is φ = 151981401600.
The previous prime is 231202301989. The next prime is 231202302041. The reversal of 231202302033 is 330203202132.
231202302033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 231202302033 - 210 = 231202301009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (231202302073) 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 in 31 ways as a sum of consecutive naturals, for example, 118625143 + ... + 118627091.
It is an arithmetic number, because the mean of its divisors is an integer number (9768973500).
Almost surely, 2231202302033 is an apocalyptic number.
It is an amenable number.
231202302033 is a deficient number, since it is larger than the sum of its proper divisors (81404849967).
231202302033 is a wasteful number, since it uses less digits than its factorization.
231202302033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3633.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 231202302033 its reverse (330203202132), we get a palindrome (561405504165).
Subtracting 231202302033 from its reverse (330203202132), we obtain a palindrome (99000900099).
The spelling of 231202302033 in words is "two hundred thirty-one billion, two hundred two million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •