Base | Representation |
---|---|
bin | 110100010111110000101001… |
… | …011010101110100010110101 |
3 | 1010012112110002102110222210222 |
4 | 310113300221122232202311 |
5 | 220142221244430202013 |
6 | 2133512405404024125 |
7 | 66341610611161451 |
oct | 6427605132564265 |
9 | 1105473072428728 |
10 | 230331201022133 |
11 | 67432a06289402 |
12 | 219bb891232045 |
13 | 9b6a1a66835b3 |
14 | 40c4137c75661 |
15 | 1b9669a7de508 |
hex | d17c296ae8b5 |
230331201022133 has 8 divisors (see below), whose sum is σ = 230753510596800. Its totient is φ = 229909237181568.
The previous prime is 230331201022123. The next prime is 230331201022151. The reversal of 230331201022133 is 331220102133032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230331201022133 - 220 = 230331199973557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230331201022123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85099868 + ... + 87764741.
It is an arithmetic number, because the mean of its divisors is an integer number (28844188824600).
Almost surely, 2230331201022133 is an apocalyptic number.
It is an amenable number.
230331201022133 is a deficient number, since it is larger than the sum of its proper divisors (422309574667).
230331201022133 is a wasteful number, since it uses less digits than its factorization.
230331201022133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172867051.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 230331201022133 its reverse (331220102133032), we get a palindrome (561551303155165).
The spelling of 230331201022133 in words is "two hundred thirty trillion, three hundred thirty-one billion, two hundred one million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •