Base | Representation |
---|---|
bin | 10101000101000100010… |
… | …011101110011010000101 |
3 | 12010110221221101100101200 |
4 | 111011010103232122011 |
5 | 142213112300002021 |
6 | 3025242113413113 |
7 | 206440263563220 |
oct | 25050423563205 |
9 | 5113857340350 |
10 | 1448550000261 |
11 | 509365791051 |
12 | 1b48a456a199 |
13 | a67a013cb90 |
14 | 501785305b7 |
15 | 27a30585126 |
hex | 151444ee685 |
1448550000261 has 48 divisors (see below), whose sum is σ = 2664000044160. Its totient is φ = 737723064960.
The previous prime is 1448550000257. The next prime is 1448550000301. The reversal of 1448550000261 is 1620000558441.
It is a happy number.
1448550000261 is a `hidden beast` number, since 1 + 4 + 48 + 550 + 0 + 0 + 0 + 2 + 61 = 666.
It is not a de Polignac number, because 1448550000261 - 22 = 1448550000257 is a prime.
It is a super-3 number, since 3×14485500002613 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1448530000261) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30470755 + ... + 30518256.
It is an arithmetic number, because the mean of its divisors is an integer number (55500000920).
Almost surely, 21448550000261 is an apocalyptic number.
It is an amenable number.
1448550000261 is a deficient number, since it is larger than the sum of its proper divisors (1215450043899).
1448550000261 is a wasteful number, since it uses less digits than its factorization.
1448550000261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60989066 (or 60989063 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 36.
The spelling of 1448550000261 in words is "one trillion, four hundred forty-eight billion, five hundred fifty million, two hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •