Base | Representation |
---|---|
bin | 1111011011101111100… |
… | …0000001101010000100 |
3 | 221100101102011011100110 |
4 | 3312323320001222010 |
5 | 13321004112000200 |
6 | 321450030113020 |
7 | 25104353402652 |
oct | 3667370015204 |
9 | 840342134313 |
10 | 265145031300 |
11 | a24a1504446 |
12 | 4347864b770 |
13 | 1c006987386 |
14 | cb93dc9dd2 |
15 | 6d6c72ab50 |
hex | 3dbbe01a84 |
265145031300 has 72 divisors (see below), whose sum is σ = 767207763616. Its totient is φ = 70700290560.
The previous prime is 265145031253. The next prime is 265145031313. The reversal of 265145031300 is 3130541562.
265145031300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 6263004 + ... + 6305196.
Almost surely, 2265145031300 is an apocalyptic number.
265145031300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
265145031300 is an abundant number, since it is smaller than the sum of its proper divisors (502062732316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
265145031300 is a wasteful number, since it uses less digits than its factorization.
265145031300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63157 (or 63150 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 265145031300 its reverse (3130541562), we get a palindrome (268275572862).
The spelling of 265145031300 in words is "two hundred sixty-five billion, one hundred forty-five million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •