Base | Representation |
---|---|
bin | 1000110001011011011… |
… | …00110100010100110101 |
3 | 1001211000002102201120022 |
4 | 10120231230310110311 |
5 | 14414244043342401 |
6 | 350245021214525 |
7 | 30530221263044 |
oct | 4305554642465 |
9 | 1054002381508 |
10 | 301414434101 |
11 | 106913654600 |
12 | 4a4bb101445 |
13 | 22566b92271 |
14 | 10834d3055b |
15 | 7c9195571b |
hex | 462db34535 |
301414434101 has 24 divisors (see below), whose sum is σ = 332082963072. Its totient is φ = 273372105600.
The previous prime is 301414434053. The next prime is 301414434103. The reversal of 301414434101 is 101434414103.
It is a happy number.
It is not a de Polignac number, because 301414434101 - 26 = 301414434037 is a prime.
It is a super-2 number, since 2×3014144341012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301414434103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 151692230 + ... + 151694216.
It is an arithmetic number, because the mean of its divisors is an integer number (13836790128).
Almost surely, 2301414434101 is an apocalyptic number.
It is an amenable number.
301414434101 is a deficient number, since it is larger than the sum of its proper divisors (30668528971).
301414434101 is a wasteful number, since it uses less digits than its factorization.
301414434101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4313 (or 4302 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 301414434101 its reverse (101434414103), we get a palindrome (402848848204).
The spelling of 301414434101 in words is "three hundred one billion, four hundred fourteen million, four hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •