Base | Representation |
---|---|
bin | 110100010110001110001001… |
… | …110100010010001011000000 |
3 | 1010012011100010001021100100221 |
4 | 310112032021310102023000 |
5 | 220134003202200331000 |
6 | 2133352035311152424 |
7 | 66331145061464143 |
oct | 6426161164221300 |
9 | 1105140101240327 |
10 | 230225444152000 |
11 | 673a20762935a0 |
12 | 219a3297515714 |
13 | 9b6022128372b |
14 | 40bcd8441405a |
15 | 1b93a5ae9561a |
hex | d16389d122c0 |
230225444152000 has 112 divisors (see below), whose sum is σ = 621985431993120. Its totient is φ = 83718343296000.
The previous prime is 230225444151991. The next prime is 230225444152007. The reversal of 230225444152000 is 251444522032.
It is not an unprimeable number, because it can be changed into a prime (230225444152007) 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 15 ways as a sum of consecutive naturals, for example, 1308011115 + ... + 1308187114.
Almost surely, 2230225444152000 is an apocalyptic number.
230225444152000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
230225444152000 is an abundant number, since it is smaller than the sum of its proper divisors (391759987841120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230225444152000 is a wasteful number, since it uses less digits than its factorization.
230225444152000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2616198267 (or 2616198247 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 34.
Adding to 230225444152000 its reverse (251444522032), we get a palindrome (230476888674032).
The spelling of 230225444152000 in words is "two hundred thirty trillion, two hundred twenty-five billion, four hundred forty-four million, one hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •