Base | Representation |
---|---|
bin | 1100000110111001… |
… | …0110001011000111 |
3 | 22101111201211120000 |
4 | 3001232112023013 |
5 | 23124014332020 |
6 | 1254302012343 |
7 | 143353560126 |
oct | 30156261307 |
9 | 8344654500 |
10 | 3250152135 |
11 | 141869844a |
12 | 7685770b3 |
13 | 3ca47b259 |
14 | 22b921abd |
15 | 140508090 |
hex | c1b962c7 |
3250152135 has 20 divisors (see below), whose sum is σ = 5826199368. Its totient is φ = 1733414256.
The previous prime is 3250152133. The next prime is 3250152173. The reversal of 3250152135 is 5312510523.
It is a happy number.
3250152135 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3250152135 - 21 = 3250152133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 3250152099 and 3250152108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3250152133) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4012129 + ... + 4012938.
Almost surely, 23250152135 is an apocalyptic number.
3250152135 is a deficient number, since it is larger than the sum of its proper divisors (2576047233).
3250152135 is an equidigital number, since it uses as much as digits as its factorization.
3250152135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8025084 (or 8025075 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 3250152135 is about 57010.1055515599. The cubic root of 3250152135 is about 1481.2711466297.
Adding to 3250152135 its reverse (5312510523), we get a palindrome (8562662658).
The spelling of 3250152135 in words is "three billion, two hundred fifty million, one hundred fifty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •