Base | Representation |
---|---|
bin | 1001100100110001… |
… | …11011000000100100 |
3 | 111021020111102000002 |
4 | 10302120323000210 |
5 | 41011413030002 |
6 | 2210023440432 |
7 | 241245230645 |
oct | 46230730044 |
9 | 14236442002 |
10 | 5140361252 |
11 | 21a8666544 |
12 | bb55b6118 |
13 | 63bc644a0 |
14 | 36a99b6cc |
15 | 201430002 |
hex | 13263b024 |
5140361252 has 24 divisors (see below), whose sum is σ = 9796462200. Its totient is φ = 2345815296.
The previous prime is 5140361249. The next prime is 5140361257. The reversal of 5140361252 is 2521630415.
It can be written as a sum of positive squares in 4 ways, for example, as 1478656 + 5138882596 = 1216^2 + 71686^2 .
It is not an unprimeable number, because it can be changed into a prime (5140361257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550727 + ... + 559982.
It is an arithmetic number, because the mean of its divisors is an integer number (408185925).
Almost surely, 25140361252 is an apocalyptic number.
5140361252 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5140361252 is a deficient number, since it is larger than the sum of its proper divisors (4656100948).
5140361252 is a wasteful number, since it uses less digits than its factorization.
5140361252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110815 (or 1110813 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 5140361252 is about 71696.3126806393. The cubic root of 5140361252 is about 1725.8294689835.
Adding to 5140361252 its reverse (2521630415), we get a palindrome (7661991667).
The spelling of 5140361252 in words is "five billion, one hundred forty million, three hundred sixty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •