Base | Representation |
---|---|
bin | 11111111111011111… |
… | …111111001111011100 |
3 | 10021200000010012211020 |
4 | 133333133333033130 |
5 | 1030322421043102 |
6 | 23440352324140 |
7 | 2324154425460 |
oct | 377737771734 |
9 | 107600105736 |
10 | 34351346652 |
11 | 13628492197 |
12 | 67a8243650 |
13 | 3315a2192c |
14 | 193c2da4a0 |
15 | d60b51bbc |
hex | 7ff7ff3dc |
34351346652 has 96 divisors (see below), whose sum is σ = 93640458240. Its totient is φ = 9596829120.
The previous prime is 34351346629. The next prime is 34351346657. The reversal of 34351346652 is 25664315343.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34351346657) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4967077 + ... + 4973987.
It is an arithmetic number, because the mean of its divisors is an integer number (975421440).
Almost surely, 234351346652 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 34351346652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46820229120).
34351346652 is an abundant number, since it is smaller than the sum of its proper divisors (59289111588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34351346652 is a wasteful number, since it uses less digits than its factorization.
34351346652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8231 (or 8229 counting only the distinct ones).
The product of its digits is 777600, while the sum is 42.
The spelling of 34351346652 in words is "thirty-four billion, three hundred fifty-one million, three hundred forty-six thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •