Base | Representation |
---|---|
bin | 11111010100101010011… |
… | …01101110001101010000 |
3 | 10210212222101021020022011 |
4 | 33222111031232031100 |
5 | 120113122234220240 |
6 | 2142230434152304 |
7 | 140520234324415 |
oct | 17522515561520 |
9 | 3725871236264 |
10 | 1076245226320 |
11 | 385484410a30 |
12 | 154700422694 |
13 | 7a64953c884 |
14 | 3a13a66410c |
15 | 1cee029e6ea |
hex | fa9536e350 |
1076245226320 has 80 divisors (see below), whose sum is σ = 2729912952960. Its totient is φ = 391338432000.
The previous prime is 1076245226317. The next prime is 1076245226327. The reversal of 1076245226320 is 236225426701.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1076245226327) 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, 22538470 + ... + 22586170.
It is an arithmetic number, because the mean of its divisors is an integer number (34123911912).
Almost surely, 21076245226320 is an apocalyptic number.
1076245226320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1076245226320 is an abundant number, since it is smaller than the sum of its proper divisors (1653667726640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1076245226320 is a wasteful number, since it uses less digits than its factorization.
1076245226320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73364 (or 73358 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 40.
The spelling of 1076245226320 in words is "one trillion, seventy-six billion, two hundred forty-five million, two hundred twenty-six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •