Base | Representation |
---|---|
bin | 10000101010010111011… |
… | …010001011000111000001 |
3 | 11001110110010100221001000 |
4 | 100222113122023013001 |
5 | 122224430342142401 |
6 | 2234001220202213 |
7 | 145503130230660 |
oct | 20522732130701 |
9 | 4043403327030 |
10 | 1145001521601 |
11 | 401657566263 |
12 | 165aaa839369 |
13 | 83c860ccb72 |
14 | 3d5c0010dd7 |
15 | 1ebb65e0186 |
hex | 10a9768b1c1 |
1145001521601 has 32 divisors (see below), whose sum is σ = 2040659916800. Its totient is φ = 619850445840.
The previous prime is 1145001521597. The next prime is 1145001521647. The reversal of 1145001521601 is 1061251005411.
1145001521601 is a `hidden beast` number, since 1 + 1 + 4 + 5 + 0 + 0 + 1 + 52 + 1 + 601 = 666.
It is not a de Polignac number, because 1145001521601 - 22 = 1145001521597 is a prime.
It is a super-2 number, since 2×11450015216012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1145001521681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 159422965 + ... + 159430146.
It is an arithmetic number, because the mean of its divisors is an integer number (63770622400).
Almost surely, 21145001521601 is an apocalyptic number.
It is an amenable number.
1145001521601 is a deficient number, since it is larger than the sum of its proper divisors (895658395199).
1145001521601 is a wasteful number, since it uses less digits than its factorization.
1145001521601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 318853146 (or 318853140 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
The spelling of 1145001521601 in words is "one trillion, one hundred forty-five billion, one million, five hundred twenty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •