Base | Representation |
---|---|
bin | 1111111101010001001000… |
… | …10111111101110101000000 |
3 | 11121020121200210111011210210 |
4 | 13332220210113331311000 |
5 | 14044410312211230111 |
6 | 202344203332154120 |
7 | 10251130062511602 |
oct | 776504427756500 |
9 | 147217623434723 |
10 | 35090493070656 |
11 | 101a9881592a11 |
12 | 3b28933168940 |
13 | 167703352286a |
14 | 894563301172 |
15 | 40cbb6cc20a6 |
hex | 1fea245fdd40 |
35090493070656 has 112 divisors (see below), whose sum is σ = 95848391618048. Its totient is φ = 11318351616000.
The previous prime is 35090493070637. The next prime is 35090493070657. The reversal of 35090493070656 is 65607039409053.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 35090493070596 and 35090493070605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (35090493070657) 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, 58633026 + ... + 59228478.
Almost surely, 235090493070656 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 35090493070656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47924195809024).
35090493070656 is an abundant number, since it is smaller than the sum of its proper divisors (60757898547392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35090493070656 is a wasteful number, since it uses less digits than its factorization.
35090493070656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605400 (or 605390 counting only the distinct ones).
The product of its (nonzero) digits is 18370800, while the sum is 57.
The spelling of 35090493070656 in words is "thirty-five trillion, ninety billion, four hundred ninety-three million, seventy thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •