Base | Representation |
---|---|
bin | 11101011101010010111… |
… | …10011011101001100000 |
3 | 10120202120012211000201120 |
4 | 32232221132123221200 |
5 | 113040401111013012 |
6 | 2052551415132240 |
7 | 133061166333510 |
oct | 16565136335140 |
9 | 3522505730646 |
10 | 1012160641632 |
11 | 360289327a48 |
12 | 1441b6674080 |
13 | 745a57b6b8a |
14 | 36dbb51d840 |
15 | 1b4de16958c |
hex | eba979ba60 |
1012160641632 has 96 divisors (see below), whose sum is σ = 3037047374592. Its totient is φ = 289134902784.
The previous prime is 1012160641627. The next prime is 1012160641633. The reversal of 1012160641632 is 2361460612101.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 1012160641593 and 1012160641602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012160641633) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3543043 + ... + 3818045.
It is an arithmetic number, because the mean of its divisors is an integer number (31635910152).
Almost surely, 21012160641632 is an apocalyptic number.
1012160641632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012160641632 is an abundant number, since it is smaller than the sum of its proper divisors (2024886732960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012160641632 is a wasteful number, since it uses less digits than its factorization.
1012160641632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 280500 (or 280492 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The spelling of 1012160641632 in words is "one trillion, twelve billion, one hundred sixty million, six hundred forty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •