Base | Representation |
---|---|
bin | 1010000000011001… |
… | …00110011110101101 |
3 | 111212101101111201111 |
4 | 11000030212132231 |
5 | 42000213344321 |
6 | 2245020512021 |
7 | 250060231624 |
oct | 50014463655 |
9 | 14771344644 |
10 | 5372012461 |
11 | 23073a7522 |
12 | 105b0ab611 |
13 | 677c511ca |
14 | 38d65c6bb |
15 | 21693c5e1 |
hex | 1403267ad |
5372012461 has 8 divisors (see below), whose sum is σ = 5884152120. Its totient is φ = 4881666048.
The previous prime is 5372012453. The next prime is 5372012491. The reversal of 5372012461 is 1642102735.
It can be written as a sum of positive squares in 4 ways, for example, as 2820247236 + 2551765225 = 53106^2 + 50515^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5372012461 - 23 = 5372012453 is a prime.
It is a super-2 number, since 2×53720124612 = 57717035762278553042, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5372012491) 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, 5447796 + ... + 5448781.
It is an arithmetic number, because the mean of its divisors is an integer number (735519015).
Almost surely, 25372012461 is an apocalyptic number.
It is an amenable number.
5372012461 is a deficient number, since it is larger than the sum of its proper divisors (512139659).
5372012461 is a wasteful number, since it uses less digits than its factorization.
5372012461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10896623.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 5372012461 is about 73294.0138142263. The cubic root of 5372012461 is about 1751.3744262209.
The spelling of 5372012461 in words is "five billion, three hundred seventy-two million, twelve thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •