Base | Representation |
---|---|
bin | 11111010001000110101… |
… | …10111010110100010000 |
3 | 10210201001020220102221011 |
4 | 33220203112322310100 |
5 | 120100214232102030 |
6 | 2141313120140304 |
7 | 140422011056440 |
oct | 17504326726420 |
9 | 3721036812834 |
10 | 1074335034640 |
11 | 38469413471a |
12 | 154268767694 |
13 | 7a40387b13a |
14 | 39dd8aa6120 |
15 | 1ce2c72bb2a |
hex | fa235bad10 |
1074335034640 has 80 divisors (see below), whose sum is σ = 2871755695872. Its totient is φ = 366137759232.
The previous prime is 1074335034593. The next prime is 1074335034671. The reversal of 1074335034640 is 464305334701.
1074335034640 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 junction number, because it is equal to n+sod(n) for n = 1074335034593 and 1074335034602.
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, 5650359 + ... + 5837398.
Almost surely, 21074335034640 is an apocalyptic number.
1074335034640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1074335034640 is an abundant number, since it is smaller than the sum of its proper divisors (1797420661232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1074335034640 is a wasteful number, since it uses less digits than its factorization.
1074335034640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11487944 (or 11487938 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 40.
The spelling of 1074335034640 in words is "one trillion, seventy-four billion, three hundred thirty-five million, thirty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •