Base | Representation |
---|---|
bin | 1000100101101… |
… | …10100011110011 |
3 | 12000120120022000 |
4 | 10102312203303 |
5 | 121421112211 |
6 | 11052145043 |
7 | 1533265011 |
oct | 422664363 |
9 | 160516260 |
10 | 72050931 |
11 | 37741a27 |
12 | 20168183 |
13 | 11c091b4 |
14 | 97d78b1 |
15 | 64d3656 |
hex | 44b68f3 |
72050931 has 8 divisors (see below), whose sum is σ = 106742160. Its totient is φ = 48033936.
The previous prime is 72050897. The next prime is 72050933. The reversal of 72050931 is 13905027.
It is not a de Polignac number, because 72050931 - 219 = 71526643 is a prime.
It is a super-2 number, since 2×720509312 = 10382673315933522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 2668553 = 72050931 / (7 + 2 + 0 + 5 + 0 + 9 + 3 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 72050895 and 72050904.
It is not an unprimeable number, because it can be changed into a prime (72050933) 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, 1334250 + ... + 1334303.
It is an arithmetic number, because the mean of its divisors is an integer number (13342770).
Almost surely, 272050931 is an apocalyptic number.
72050931 is a deficient number, since it is larger than the sum of its proper divisors (34691229).
72050931 is a wasteful number, since it uses less digits than its factorization.
72050931 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2668562 (or 2668556 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 72050931 is about 8488.2819816498. The cubic root of 72050931 is about 416.1148347762.
Adding to 72050931 its reverse (13905027), we get a palindrome (85955958).
The spelling of 72050931 in words is "seventy-two million, fifty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •