Base | Representation |
---|---|
bin | 1000110001011011011… |
… | …00110100010100000101 |
3 | 1001211000002102201111112 |
4 | 10120231230310110011 |
5 | 14414244043342203 |
6 | 350245021214405 |
7 | 30530221262645 |
oct | 4305554642405 |
9 | 1054002381445 |
10 | 301414434053 |
11 | 106913654567 |
12 | 4a4bb101405 |
13 | 22566b92235 |
14 | 10834d30525 |
15 | 7c919556d8 |
hex | 462db34505 |
301414434053 has 2 divisors, whose sum is σ = 301414434054. Its totient is φ = 301414434052.
The previous prime is 301414434047. The next prime is 301414434103. The reversal of 301414434053 is 350434414103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 220094216164 + 81320217889 = 469142^2 + 285167^2 .
It is a cyclic number.
It is not a de Polignac number, because 301414434053 - 24 = 301414434037 is a prime.
It is a super-2 number, since 2×3014144340532 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301414434023) 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 as a sum of consecutive naturals, namely, 150707217026 + 150707217027.
It is an arithmetic number, because the mean of its divisors is an integer number (150707217027).
Almost surely, 2301414434053 is an apocalyptic number.
It is an amenable number.
301414434053 is a deficient number, since it is larger than the sum of its proper divisors (1).
301414434053 is an equidigital number, since it uses as much as digits as its factorization.
301414434053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 301414434053 its reverse (350434414103), we get a palindrome (651848848156).
The spelling of 301414434053 in words is "three hundred one billion, four hundred fourteen million, four hundred thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •