Base | Representation |
---|---|
bin | 100000001000101010… |
… | …111001011101011110 |
3 | 10022001201121212000000 |
4 | 200020222321131132 |
5 | 1031131312422002 |
6 | 23503530115130 |
7 | 2331033242052 |
oct | 401052713536 |
9 | 108051555000 |
10 | 34505201502 |
11 | 136a7317662 |
12 | 682b87baa6 |
13 | 333b8702c5 |
14 | 1954909c62 |
15 | d6e3e361c |
hex | 808ab975e |
34505201502 has 56 divisors (see below), whose sum is σ = 77643965640. Its totient is φ = 11495396880.
The previous prime is 34505201483. The next prime is 34505201509. The reversal of 34505201502 is 20510250543.
It is a happy number.
34505201502 is a `hidden beast` number, since 3 + 4 + 505 + 2 + 0 + 150 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34505201509) 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 27 ways as a sum of consecutive naturals, for example, 3171552 + ... + 3182412.
Almost surely, 234505201502 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 34505201502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38821982820).
34505201502 is an abundant number, since it is smaller than the sum of its proper divisors (43138764138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34505201502 is a wasteful number, since it uses less digits than its factorization.
34505201502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13060 (or 13045 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The spelling of 34505201502 in words is "thirty-four billion, five hundred five million, two hundred one thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •