Base | Representation |
---|---|
bin | 1000110001011011011… |
… | …00110100010100110110 |
3 | 1001211000002102201120100 |
4 | 10120231230310110312 |
5 | 14414244043342402 |
6 | 350245021214530 |
7 | 30530221263045 |
oct | 4305554642466 |
9 | 1054002381510 |
10 | 301414434102 |
11 | 106913654601 |
12 | 4a4bb101446 |
13 | 22566b92272 |
14 | 10834d3055c |
15 | 7c9195571c |
hex | 462db34536 |
301414434102 has 48 divisors (see below), whose sum is σ = 667046315520. Its totient is φ = 98321002416.
The previous prime is 301414434053. The next prime is 301414434103. The reversal of 301414434102 is 201434414103.
301414434102 is a `hidden beast` number, since 301 + 4 + 14 + 4 + 341 + 0 + 2 = 666.
It is a super-2 number, since 2×3014144341022 (a number of 24 digits) contains 22 as substring.
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, 8220903 + ... + 8257485.
It is an arithmetic number, because the mean of its divisors is an integer number (13896798240).
Almost surely, 2301414434102 is an apocalyptic number.
301414434102 is an abundant number, since it is smaller than the sum of its proper divisors (365631881418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301414434102 is a wasteful number, since it uses less digits than its factorization.
301414434102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46377 (or 46374 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 301414434102 its reverse (201434414103), we get a palindrome (502848848205).
The spelling of 301414434102 in words is "three hundred one billion, four hundred fourteen million, four hundred thirty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.360 sec. • engine limits •