Base | Representation |
---|---|
bin | 110100011010110000000100… |
… | …010101011000101101011111 |
3 | 1010020021002121121020111012222 |
4 | 310122300010111120231133 |
5 | 220204103214221421244 |
6 | 2134151040503415555 |
7 | 66362505155523326 |
oct | 6432600425305537 |
9 | 1106232547214188 |
10 | 230536737295199 |
11 | 67502099139495 |
12 | 21a33692a545bb |
13 | 9b836a097679a |
14 | 40d00753330bd |
15 | 1b9bbc9ceabee |
hex | d1ac04558b5f |
230536737295199 has 8 divisors (see below), whose sum is σ = 243614492006640. Its totient is φ = 217553406806016.
The previous prime is 230536737295147. The next prime is 230536737295229. The reversal of 230536737295199 is 991592737635032.
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 230536737295199 - 220 = 230536736246623 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 (230536737295129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23606050544 + ... + 23606060309.
It is an arithmetic number, because the mean of its divisors is an integer number (30451811500830).
Almost surely, 2230536737295199 is an apocalyptic number.
230536737295199 is a deficient number, since it is larger than the sum of its proper divisors (13077754711441).
230536737295199 is a wasteful number, since it uses less digits than its factorization.
230536737295199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47212111129.
The product of its (nonzero) digits is 578680200, while the sum is 71.
The spelling of 230536737295199 in words is "two hundred thirty trillion, five hundred thirty-six billion, seven hundred thirty-seven million, two hundred ninety-five thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •