Base | Representation |
---|---|
bin | 1011011010101001… |
… | …0000010101001101 |
3 | 21220120110021012111 |
4 | 2312222100111031 |
5 | 22234004432003 |
6 | 1224031304021 |
7 | 135641035351 |
oct | 26652202515 |
9 | 7816407174 |
10 | 3064530253 |
11 | 1332935a34 |
12 | 71637b011 |
13 | 39ab89515 |
14 | 211003461 |
15 | 12e08de6d |
hex | b6a9054d |
3064530253 has 8 divisors (see below), whose sum is σ = 3171421080. Its totient is φ = 2957720640.
The previous prime is 3064530239. The next prime is 3064530283. The reversal of 3064530253 is 3520354603.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1301622084 + 1762908169 = 36078^2 + 41987^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3064530253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3064530223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62223 + ... + 100003.
It is an arithmetic number, because the mean of its divisors is an integer number (396427635).
Almost surely, 23064530253 is an apocalyptic number.
It is an amenable number.
3064530253 is a deficient number, since it is larger than the sum of its proper divisors (106890827).
3064530253 is a wasteful number, since it uses less digits than its factorization.
3064530253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40607.
The product of its (nonzero) digits is 32400, while the sum is 31.
The square root of 3064530253 is about 55358.1995100997. The cubic root of 3064530253 is about 1452.5172687525.
Adding to 3064530253 its reverse (3520354603), we get a palindrome (6584884856).
The spelling of 3064530253 in words is "three billion, sixty-four million, five hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •