Base | Representation |
---|---|
bin | 10100001111001100000111 |
3 | 100222112020000 |
4 | 110033030013 |
5 | 2324230340 |
6 | 305412343 |
7 | 63043515 |
oct | 24171407 |
9 | 10875200 |
10 | 5305095 |
11 | 2aa3884 |
12 | 193a0b3 |
13 | 1139913 |
14 | 9c14b5 |
15 | 6ebd30 |
hex | 50f307 |
5305095 has 20 divisors (see below), whose sum is σ = 9510600. Its totient is φ = 2829168.
The previous prime is 5305093. The next prime is 5305151. The reversal of 5305095 is 5905035.
It is not a de Polignac number, because 5305095 - 21 = 5305093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5305093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6145 + ... + 6954.
It is an arithmetic number, because the mean of its divisors is an integer number (475530).
Almost surely, 25305095 is an apocalyptic number.
5305095 is a deficient number, since it is larger than the sum of its proper divisors (4205505).
5305095 is a wasteful number, since it uses less digits than its factorization.
5305095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13116 (or 13107 counting only the distinct ones).
The product of its (nonzero) digits is 3375, while the sum is 27.
The square root of 5305095 is about 2303.2791841199. The cubic root of 5305095 is about 174.4071914206.
It can be divided in two parts, 530 and 5095, that added together give a square (5625 = 752).
The spelling of 5305095 in words is "five million, three hundred five thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •