Base | Representation |
---|---|
bin | 1111011100000011000… |
… | …0110010110000011100 |
3 | 221100121010102200112121 |
4 | 3313000300302300130 |
5 | 13321141104140330 |
6 | 321502115312324 |
7 | 25106400324661 |
oct | 3670060626034 |
9 | 840533380477 |
10 | 265227021340 |
11 | a2533814806 |
12 | 4349bbab6a4 |
13 | 1c01a9634a8 |
14 | cba0c4da68 |
15 | 6d74a2417a |
hex | 3dc0c32c1c |
265227021340 has 48 divisors (see below), whose sum is σ = 574340364864. Its totient is φ = 102817728000.
The previous prime is 265227021331. The next prime is 265227021343. The reversal of 265227021340 is 43120722562.
It is a junction number, because it is equal to n+sod(n) for n = 265227021296 and 265227021305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (265227021343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 947199 + ... + 1194838.
It is an arithmetic number, because the mean of its divisors is an integer number (11965424268).
Almost surely, 2265227021340 is an apocalyptic number.
265227021340 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
265227021340 is an abundant number, since it is smaller than the sum of its proper divisors (309113343524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
265227021340 is a wasteful number, since it uses less digits than its factorization.
265227021340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2142238 (or 2142236 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 34.
The spelling of 265227021340 in words is "two hundred sixty-five billion, two hundred twenty-seven million, twenty-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •