Base | Representation |
---|---|
bin | 1111111011110111000011… |
… | …11001010111101001011010 |
3 | 11121001222212111200210221001 |
4 | 13331323201321113221122 |
5 | 14043112242034112214 |
6 | 202310044514335214 |
7 | 10244465503612636 |
oct | 775734171275132 |
9 | 147058774623831 |
10 | 35042133113434 |
11 | 10190315661317 |
12 | 3b1b49758a50a |
13 | 16725c7498a65 |
14 | 892096729dc6 |
15 | 40b7d63dac74 |
hex | 1fdee1e57a5a |
35042133113434 has 8 divisors (see below), whose sum is σ = 52563880657620. Its totient is φ = 17520839560896.
The previous prime is 35042133113359. The next prime is 35042133113453. The reversal of 35042133113434 is 43431133124053.
It can be written as a sum of positive squares in 2 ways, for example, as 26118201696409 + 8923931417025 = 5110597^2 + 2987295^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×350421331134342 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 35042133113393 and 35042133113402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113304879 + ... + 113613730.
Almost surely, 235042133113434 is an apocalyptic number.
35042133113434 is a deficient number, since it is larger than the sum of its proper divisors (17521747544186).
35042133113434 is a wasteful number, since it uses less digits than its factorization.
35042133113434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226995824.
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 35042133113434 its reverse (43431133124053), we get a palindrome (78473266237487).
The spelling of 35042133113434 in words is "thirty-five trillion, forty-two billion, one hundred thirty-three million, one hundred thirteen thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •