Base | Representation |
---|---|
bin | 1100110011010… |
… | …0011001101011 |
3 | 10202000211121000 |
4 | 3030310121223 |
5 | 102221121021 |
6 | 5154450043 |
7 | 1221242322 |
oct | 314643153 |
9 | 122024530 |
10 | 53692011 |
11 | 2834266a |
12 | 15b93923 |
13 | b17ba29 |
14 | 71b90b9 |
15 | 4aa8b26 |
hex | 333466b |
53692011 has 16 divisors (see below), whose sum is σ = 80636320. Its totient is φ = 35303040.
The previous prime is 53692007. The next prime is 53692013. The reversal of 53692011 is 11029635.
It is not a de Polignac number, because 53692011 - 22 = 53692007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a plaindrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (53692013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11650 + ... + 15591.
It is an arithmetic number, because the mean of its divisors is an integer number (5039770).
Almost surely, 253692011 is an apocalyptic number.
53692011 is a deficient number, since it is larger than the sum of its proper divisors (26944309).
53692011 is a wasteful number, since it uses less digits than its factorization.
53692011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27323 (or 27317 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 53692011 is about 7327.4832650781. The cubic root of 53692011 is about 377.2563484816.
The spelling of 53692011 in words is "fifty-three million, six hundred ninety-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •