Base | Representation |
---|---|
bin | 10000010100000010011… |
… | …101011110011110000000 |
3 | 10222011120100110220222201 |
4 | 100110002131132132000 |
5 | 121331331100330124 |
6 | 2214554255042544 |
7 | 143664053421331 |
oct | 20240235363600 |
9 | 3864510426881 |
10 | 1121027745664 |
11 | 3a2474a345a2 |
12 | 161319b10454 |
13 | 81935385c28 |
14 | 3c388080288 |
15 | 1e261a7e144 |
hex | 1050275e780 |
1121027745664 has 128 divisors (see below), whose sum is σ = 2420008980480. Its totient is φ = 515734855680.
The previous prime is 1121027745659. The next prime is 1121027745737. The reversal of 1121027745664 is 4665477201211.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15204312 + ... + 15277864.
It is an arithmetic number, because the mean of its divisors is an integer number (18906320160).
Almost surely, 21121027745664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1121027745664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1210004490240).
1121027745664 is an abundant number, since it is smaller than the sum of its proper divisors (1298981234816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121027745664 is a wasteful number, since it uses less digits than its factorization.
1121027745664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73788 (or 73776 counting only the distinct ones).
The product of its (nonzero) digits is 564480, while the sum is 46.
The spelling of 1121027745664 in words is "one trillion, one hundred twenty-one billion, twenty-seven million, seven hundred forty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •