Base | Representation |
---|---|
bin | 1100000110111110… |
… | …1011011011010011 |
3 | 22101112101120120012 |
4 | 3001233223123103 |
5 | 23124112020311 |
6 | 1254313305135 |
7 | 143356543160 |
oct | 30157533323 |
9 | 8345346505 |
10 | 3250501331 |
11 | 1418906840 |
12 | 7687051ab |
13 | 3ca57118c |
14 | 22b9b3067 |
15 | 14057678b |
hex | c1beb6d3 |
3250501331 has 32 divisors (see below), whose sum is σ = 4106930688. Its totient is φ = 2499056640.
The previous prime is 3250501321. The next prime is 3250501367. The reversal of 3250501331 is 1331050523.
It is a cyclic number.
It is not a de Polignac number, because 3250501331 - 214 = 3250484947 is a prime.
It is a super-2 number, since 2×32505013312 = 21131517805665543122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3250501297 and 3250501306.
It is not an unprimeable number, because it can be changed into a prime (3250501301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4204661 + ... + 4205433.
It is an arithmetic number, because the mean of its divisors is an integer number (128341584).
Almost surely, 23250501331 is an apocalyptic number.
3250501331 is a deficient number, since it is larger than the sum of its proper divisors (856429357).
3250501331 is a wasteful number, since it uses less digits than its factorization.
3250501331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451.
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 3250501331 is about 57013.1680491446. The cubic root of 3250501331 is about 1481.3241939348.
Adding to 3250501331 its reverse (1331050523), we get a palindrome (4581551854).
The spelling of 3250501331 in words is "three billion, two hundred fifty million, five hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •