Base | Representation |
---|---|
bin | 1100001111111… |
… | …0000110010001 |
3 | 10120122222201201 |
4 | 3003332012101 |
5 | 101122404213 |
6 | 5033031201 |
7 | 1162441600 |
oct | 303760621 |
9 | 116588651 |
10 | 51372433 |
11 | 26aa8962 |
12 | 15255501 |
13 | a848cb8 |
14 | 6b73a37 |
15 | 479b6dd |
hex | 30fe191 |
51372433 has 12 divisors (see below), whose sum is σ = 59879412. Its totient is φ = 43945440.
The previous prime is 51372403. The next prime is 51372469. The reversal of 51372433 is 33427315.
51372433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 23736384 + 27636049 = 4872^2 + 5257^2 .
It is not a de Polignac number, because 51372433 - 29 = 51371921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51372403) 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 11 ways as a sum of consecutive naturals, for example, 39591 + ... + 40867.
It is an arithmetic number, because the mean of its divisors is an integer number (4989951).
Almost surely, 251372433 is an apocalyptic number.
It is an amenable number.
51372433 is a deficient number, since it is larger than the sum of its proper divisors (8506979).
51372433 is a wasteful number, since it uses less digits than its factorization.
51372433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2112 (or 2105 counting only the distinct ones).
The product of its digits is 7560, while the sum is 28.
The square root of 51372433 is about 7167.4565223655. The cubic root of 51372433 is about 371.7434953706.
Adding to 51372433 its reverse (33427315), we get a palindrome (84799748).
The spelling of 51372433 in words is "fifty-one million, three hundred seventy-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •