Base | Representation |
---|---|
bin | 111100010011100110111001… |
… | …101001010000011010110000 |
3 | 1021210002202120202120000122222 |
4 | 330103212321221100122300 |
5 | 234231013002341430000 |
6 | 2340033030253020212 |
7 | 106603152232220564 |
oct | 7423467151203260 |
9 | 1253082522500588 |
10 | 265230230030000 |
11 | 77568566350084 |
12 | 258b748b484668 |
13 | b4cc1461556c1 |
14 | 496d2d69cb6a4 |
15 | 209e3a86eda85 |
hex | f139b9a506b0 |
265230230030000 has 100 divisors (see below), whose sum is σ = 643718966086680. Its totient is φ = 105832696512000.
The previous prime is 265230230029987. The next prime is 265230230030021. The reversal of 265230230030000 is 30032032562.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (100).
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 28334234 + ... + 36514233.
Almost surely, 2265230230030000 is an apocalyptic number.
265230230030000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
265230230030000 is an abundant number, since it is smaller than the sum of its proper divisors (378488736056680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
265230230030000 is an equidigital number, since it uses as much as digits as its factorization.
265230230030000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64848904 (or 64848883 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 26.
Adding to 265230230030000 its reverse (30032032562), we get a palindrome (265260262062562).
The spelling of 265230230030000 in words is "two hundred sixty-five trillion, two hundred thirty billion, two hundred thirty million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •