Base | Representation |
---|---|
bin | 100110111001001… |
… | …1011011001110001 |
3 | 10100221201011201110 |
4 | 1031302123121301 |
5 | 10133044040243 |
6 | 333300023533 |
7 | 44224604304 |
oct | 11562333161 |
9 | 3327634643 |
10 | 1305065073 |
11 | 60a747784 |
12 | 305091ba9 |
13 | 17a4bc570 |
14 | c547cb3b |
15 | 79890e33 |
hex | 4dc9b671 |
1305065073 has 32 divisors (see below), whose sum is σ = 1957334400. Its totient is φ = 768116736.
The previous prime is 1305065039. The next prime is 1305065089. The reversal of 1305065073 is 3705605031.
It is not a de Polignac number, because 1305065073 - 26 = 1305065009 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1305065073.
It is not an unprimeable number, because it can be changed into a prime (1305065033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 77473 + ... + 92801.
It is an arithmetic number, because the mean of its divisors is an integer number (61166700).
Almost surely, 21305065073 is an apocalyptic number.
1305065073 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1305065073 is a deficient number, since it is larger than the sum of its proper divisors (652269327).
1305065073 is a wasteful number, since it uses less digits than its factorization.
1305065073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15441.
The product of its (nonzero) digits is 9450, while the sum is 30.
The square root of 1305065073 is about 36125.6843949011. The cubic root of 1305065073 is about 1092.8084781196.
The spelling of 1305065073 in words is "one billion, three hundred five million, sixty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •