Base | Representation |
---|---|
bin | 11001011110000… |
… | …010100000110101 |
3 | 1002210001100021121 |
4 | 121132002200311 |
5 | 1333342230023 |
6 | 110222343541 |
7 | 13406014132 |
oct | 3136024065 |
9 | 1083040247 |
10 | 427305013 |
11 | 1aa225643 |
12 | bb12abb1 |
13 | 6a6b1a05 |
14 | 40a71589 |
15 | 277a8d5d |
hex | 19782835 |
427305013 has 4 divisors (see below), whose sum is σ = 452440620. Its totient is φ = 402169408.
The previous prime is 427304987. The next prime is 427305019. The reversal of 427305013 is 310503724.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 319622884 + 107682129 = 17878^2 + 10377^2 .
It is a de Polignac number, because none of the positive numbers 2k-427305013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427305019) 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 3 ways as a sum of consecutive naturals, for example, 12567778 + ... + 12567811.
It is an arithmetic number, because the mean of its divisors is an integer number (113110155).
Almost surely, 2427305013 is an apocalyptic number.
It is an amenable number.
427305013 is a deficient number, since it is larger than the sum of its proper divisors (25135607).
427305013 is a wasteful number, since it uses less digits than its factorization.
427305013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25135606.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 427305013 is about 20671.3573090883. The cubic root of 427305013 is about 753.2040778360.
Adding to 427305013 its reverse (310503724), we get a palindrome (737808737).
The spelling of 427305013 in words is "four hundred twenty-seven million, three hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •