Base | Representation |
---|---|
bin | 100000101100011100… |
… | …100001010000100100 |
3 | 10100121120000201012100 |
4 | 200230130201100210 |
5 | 1033343441142012 |
6 | 24043250452100 |
7 | 2351642036220 |
oct | 405434412044 |
9 | 110546021170 |
10 | 35105412132 |
11 | 139850a97aa |
12 | 6978894030 |
13 | 3406010a1b |
14 | 19b0509780 |
15 | da6e538dc |
hex | 82c721424 |
35105412132 has 144 divisors (see below), whose sum is σ = 103315080960. Its totient is φ = 9844015104.
The previous prime is 35105412127. The next prime is 35105412169. The reversal of 35105412132 is 23121450153.
35105412132 is a `hidden beast` number, since 3 + 510 + 5 + 4 + 12 + 132 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 35105412096 and 35105412105.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2927044 + ... + 2939012.
It is an arithmetic number, because the mean of its divisors is an integer number (717465840).
Almost surely, 235105412132 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 35105412132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51657540480).
35105412132 is an abundant number, since it is smaller than the sum of its proper divisors (68209668828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35105412132 is a wasteful number, since it uses less digits than its factorization.
35105412132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12202 (or 12197 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 35105412132 its reverse (23121450153), we get a palindrome (58226862285).
The spelling of 35105412132 in words is "thirty-five billion, one hundred five million, four hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •