Base | Representation |
---|---|
bin | 1000111010101111011… |
… | …01111110111011110101 |
3 | 1002021220112122202212012 |
4 | 10131113231332323311 |
5 | 20010014033200234 |
6 | 352433110534005 |
7 | 31065143000402 |
oct | 4352755767365 |
9 | 1067815582765 |
10 | 306414350069 |
11 | 108a49a04463 |
12 | 4b475667305 |
13 | 22b829c1819 |
14 | 10b8adad2a9 |
15 | 7e858920ce |
hex | 4757b7eef5 |
306414350069 has 2 divisors, whose sum is σ = 306414350070. Its totient is φ = 306414350068.
The previous prime is 306414349973. The next prime is 306414350071. The reversal of 306414350069 is 960053414603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201753688900 + 104660661169 = 449170^2 + 323513^2 .
It is an emirp because it is prime and its reverse (960053414603) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-306414350069 is a prime.
It is a super-2 number, since 2×3064143500692 (a number of 24 digits) contains 22 as substring.
Together with 306414350071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (306414350089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 153207175034 + 153207175035.
It is an arithmetic number, because the mean of its divisors is an integer number (153207175035).
Almost surely, 2306414350069 is an apocalyptic number.
It is an amenable number.
306414350069 is a deficient number, since it is larger than the sum of its proper divisors (1).
306414350069 is an equidigital number, since it uses as much as digits as its factorization.
306414350069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 306414350069 in words is "three hundred six billion, four hundred fourteen million, three hundred fifty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •