Base | Representation |
---|---|
bin | 1100110011001100… |
… | …1011110111010000 |
3 | 22212110101100202011 |
4 | 3030303023313100 |
5 | 24014102020000 |
6 | 1324540432304 |
7 | 151101156151 |
oct | 31463136720 |
9 | 8773340664 |
10 | 3435970000 |
11 | 1503574131 |
12 | 7ba848694 |
13 | 429b0b258 |
14 | 248491928 |
15 | 1519b02ba |
hex | ccccbdd0 |
3435970000 has 100 divisors (see below), whose sum is σ = 8681096160. Its totient is φ = 1314544000.
The previous prime is 3435969991. The next prime is 3435970003. The reversal of 3435970000 is 795343.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3435970003) 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 19 ways as a sum of consecutive naturals, for example, 222531 + ... + 237469.
Almost surely, 23435970000 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 3435970000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4340548080).
3435970000 is an abundant number, since it is smaller than the sum of its proper divisors (5245126160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3435970000 is a wasteful number, since it uses less digits than its factorization.
3435970000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14990 (or 14969 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 31.
The square root of 3435970000 is about 58617.1476617551. The cubic root of 3435970000 is about 1508.9787401727.
The spelling of 3435970000 in words is "three billion, four hundred thirty-five million, nine hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •