Base | Representation |
---|---|
bin | 1101011010111100011… |
… | …1011110000001000100 |
3 | 211001010220110110022220 |
4 | 3112233013132001010 |
5 | 12234202214044234 |
6 | 253531205452340 |
7 | 22441525116102 |
oct | 3265707360104 |
9 | 731126413286 |
10 | 230571237444 |
11 | 8986a4a8399 |
12 | 38829a110b0 |
13 | 18986b4c1a2 |
14 | b234346c72 |
15 | 5ee72d8a49 |
hex | 35af1de044 |
230571237444 has 12 divisors (see below), whose sum is σ = 537999554064. Its totient is φ = 76857079144.
The previous prime is 230571237437. The next prime is 230571237509. The reversal of 230571237444 is 444732175032.
230571237444 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 230571237396 and 230571237405.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 9607134882 + ... + 9607134905.
It is an arithmetic number, because the mean of its divisors is an integer number (44833296172).
Almost surely, 2230571237444 is an apocalyptic number.
It is an amenable number.
230571237444 is an abundant number, since it is smaller than the sum of its proper divisors (307428316620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230571237444 is a wasteful number, since it uses less digits than its factorization.
230571237444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19214269794 (or 19214269792 counting only the distinct ones).
The product of its (nonzero) digits is 564480, while the sum is 42.
The spelling of 230571237444 in words is "two hundred thirty billion, five hundred seventy-one million, two hundred thirty-seven thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •