Base | Representation |
---|---|
bin | 1111111011110111110100… |
… | …10001110001010011011000 |
3 | 11121002000221000101200122220 |
4 | 13331323322101301103120 |
5 | 14043114111243210120 |
6 | 202310153245544040 |
7 | 10244511601515510 |
oct | 775737221612330 |
9 | 147060830350586 |
10 | 35042542163160 |
11 | 10190505548444 |
12 | 3b1b590575020 |
13 | 167266115850c |
14 | 8920d4ba8840 |
15 | 40b80c28ab40 |
hex | 1fdefa4714d8 |
35042542163160 has 64 divisors (see below), whose sum is σ = 120145858848000. Its totient is φ = 8009723922816.
The previous prime is 35042542163119. The next prime is 35042542163171. The reversal of 35042542163160 is 6136124524053.
It is a super-2 number, since 2×350425421631602 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 20858655210 + ... + 20858656889.
It is an arithmetic number, because the mean of its divisors is an integer number (1877279044500).
Almost surely, 235042542163160 is an apocalyptic number.
35042542163160 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
35042542163160 is an abundant number, since it is smaller than the sum of its proper divisors (85103316684840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35042542163160 is a wasteful number, since it uses less digits than its factorization.
35042542163160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41717312120 (or 41717312116 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 35042542163160 in words is "thirty-five trillion, forty-two billion, five hundred forty-two million, one hundred sixty-three thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •