Base | Representation |
---|---|
bin | 100000111111111001… |
… | …000001001101000000 |
3 | 10101110021220022120111 |
4 | 200333321001031000 |
5 | 1040031000300422 |
6 | 24135503121104 |
7 | 2363013025315 |
oct | 407771011500 |
9 | 111407808514 |
10 | 35431650112 |
11 | 14032274171 |
12 | 6a49ba3194 |
13 | 3458797351 |
14 | 1a0198cd0c |
15 | dc58e6a77 |
hex | 83fe41340 |
35431650112 has 56 divisors (see below), whose sum is σ = 71861013504. Its totient is φ = 17325522432.
The previous prime is 35431650061. The next prime is 35431650173. The reversal of 35431650112 is 21105613453.
It is a super-2 number, since 2×354316501122 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4709778 + ... + 4717294.
It is an arithmetic number, because the mean of its divisors is an integer number (1283232384).
Almost surely, 235431650112 is an apocalyptic number.
35431650112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 35431650112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35930506752).
35431650112 is an abundant number, since it is smaller than the sum of its proper divisors (36429363392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35431650112 is a wasteful number, since it uses less digits than its factorization.
35431650112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9143 (or 9133 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 35431650112 in words is "thirty-five billion, four hundred thirty-one million, six hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •