Base | Representation |
---|---|
bin | 100000100110101101… |
… | …100110010101000010 |
3 | 10100100212000221200212 |
4 | 200212231212111002 |
5 | 1033144330213200 |
6 | 24025533114122 |
7 | 2346363340301 |
oct | 404655462502 |
9 | 110325027625 |
10 | 35009226050 |
11 | 13935882777 |
12 | 6950628942 |
13 | 33bc104196 |
14 | 19a182c438 |
15 | d9d7a4035 |
hex | 826b66542 |
35009226050 has 54 divisors (see below), whose sum is σ = 66650494233. Its totient is φ = 13681395440.
The previous prime is 35009225983. The next prime is 35009226053. The reversal of 35009226050 is 5062290053.
It can be written as a sum of positive squares in 2 ways, for example, as 34309041529 + 700184521 = 185227^2 + 26461^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=132305.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 35009225998 and 35009226016.
It is not an unprimeable number, because it can be changed into a prime (35009226053) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 62183069 + ... + 62183631.
Almost surely, 235009226050 is an apocalyptic number.
35009226050 is a deficient number, since it is larger than the sum of its proper divisors (31641268183).
35009226050 is an frugal number, since it uses more digits than its factorization.
35009226050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1232 (or 617 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 32.
Multiplying 35009226050 by its sum of digits (32), we get a square (1120295233600 = 10584402).
Multiplying 35009226050 by its product of nonzero digits (16200), we get a square (567149462010000 = 238149002).
The spelling of 35009226050 in words is "thirty-five billion, nine million, two hundred twenty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •