Base | Representation |
---|---|
bin | 100000101011110001… |
… | …011001001101110100 |
3 | 10100120202202100110121 |
4 | 200223301121031310 |
5 | 1033333042410441 |
6 | 24042204301324 |
7 | 2351443662514 |
oct | 405361311564 |
9 | 110522670417 |
10 | 35094106996 |
11 | 13979788013 |
12 | 6974b41844 |
13 | 34038830b0 |
14 | 19acc05844 |
15 | da5e6ddd1 |
hex | 82bc59374 |
35094106996 has 12 divisors (see below), whose sum is σ = 66138894052. Its totient is φ = 16197280128.
The previous prime is 35094106991. The next prime is 35094107003. The reversal of 35094106996 is 69960149053.
It can be written as a sum of positive squares in 2 ways, for example, as 7642256400 + 27451850596 = 87420^2 + 165686^2 .
It is a super-2 number, since 2×350941069962 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52), and also a Moran number because the ratio is a prime number: 674886673 = 35094106996 / (3 + 5 + 0 + 9 + 4 + 1 + 0 + 6 + 9 + 9 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (35094106991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337443285 + ... + 337443388.
Almost surely, 235094106996 is an apocalyptic number.
It is an amenable number.
35094106996 is a deficient number, since it is larger than the sum of its proper divisors (31044787056).
35094106996 is a wasteful number, since it uses less digits than its factorization.
35094106996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674886690 (or 674886688 counting only the distinct ones).
The product of its (nonzero) digits is 1574640, while the sum is 52.
The spelling of 35094106996 in words is "thirty-five billion, ninety-four million, one hundred six thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •