Base | Representation |
---|---|
bin | 1011101101111011… |
… | …1100001001000100 |
3 | 22010012201102022002 |
4 | 2323132330021010 |
5 | 22420213400202 |
6 | 1240041524432 |
7 | 140642612213 |
oct | 27336741104 |
9 | 8105642262 |
10 | 3145450052 |
11 | 13745851a8 |
12 | 7394a3718 |
13 | 3b187c464 |
14 | 21ba6907a |
15 | 136225302 |
hex | bb7bc244 |
3145450052 has 12 divisors (see below), whose sum is σ = 5506127340. Its totient is φ = 1572270816.
The previous prime is 3145450051. The next prime is 3145450073. The reversal of 3145450052 is 2500545413.
It can be written as a sum of positive squares in 2 ways, for example, as 2382806596 + 762643456 = 48814^2 + 27616^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3145449997 and 3145450024.
It is not an unprimeable number, because it can be changed into a prime (3145450051) 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 3 ways as a sum of consecutive naturals, for example, 97727 + ... + 125862.
It is an arithmetic number, because the mean of its divisors is an integer number (458843945).
Almost surely, 23145450052 is an apocalyptic number.
It is an amenable number.
3145450052 is a deficient number, since it is larger than the sum of its proper divisors (2360677288).
3145450052 is a wasteful number, since it uses less digits than its factorization.
3145450052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227110 (or 227108 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 29.
The square root of 3145450052 is about 56084.3119954235. The cubic root of 3145450052 is about 1465.1910744888.
Adding to 3145450052 its reverse (2500545413), we get a palindrome (5645995465).
The spelling of 3145450052 in words is "three billion, one hundred forty-five million, four hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •