Search a number
-
+
301030102013100 = 2235250315591279601
BaseRepresentation
bin100010001110010010000100…
…0010011000001010010101100
31110110212012022101121201101020
41010130210020103001102230
5303424034122103404400
62544123153021214140
7120256464361223205
oct10434441023012254
91413765271551336
10301030102013100
1187a10170825399
1229919798101350
13cbc802ac32615
145449d12a805ac
1524c073cb502a0
hex111c9084c14ac

301030102013100 has 144 divisors (see below), whose sum is σ = 873272471984640. Its totient is φ = 80063650688000.

The previous prime is 301030102013059. The next prime is 301030102013197. The reversal of 301030102013100 is 1310201030103.

It is a super-2 number, since 2×3010301020131002 (a number of 30 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a self number, because there is not a number n which added to its sum of digits gives 301030102013100.

It is an unprimeable number.

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 in 47 ways as a sum of consecutive naturals, for example, 234613300 + ... + 235892900.

It is an arithmetic number, because the mean of its divisors is an integer number (6064392166560).

Almost surely, 2301030102013100 is an apocalyptic number.

301030102013100 is a gapful number since it is divisible by the number (30) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 301030102013100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (436636235992320).

301030102013100 is an abundant number, since it is smaller than the sum of its proper divisors (572242369971540).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

301030102013100 is a wasteful number, since it uses less digits than its factorization.

301030102013100 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1281680 (or 1281673 counting only the distinct ones).

The product of its (nonzero) digits is 54, while the sum is 15.

Adding to 301030102013100 its reverse (1310201030103), we get a palindrome (302340303043203).

The spelling of 301030102013100 in words is "three hundred one trillion, thirty billion, one hundred two million, thirteen thousand, one hundred".

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 60 75 100 150 300 503 1006 1509 1559 2012 2515 3018 3118 4677 5030 6036 6236 7545 7795 9354 10060 12575 15090 15590 18708 23385 25150 30180 31180 37725 38975 46770 50300 75450 77950 93540 116925 150900 155900 233850 467700 784177 1279601 1568354 2352531 2559202 3136708 3838803 3920885 4705062 5118404 6398005 7677606 7841770 9410124 11762655 12796010 15355212 15683540 19194015 19604425 23525310 25592020 31990025 38388030 39208850 47050620 58813275 63980050 76776060 78417700 95970075 117626550 127960100 191940150 235253100 383880300 643639303 1287278606 1930917909 1994897959 2574557212 3218196515 3861835818 3989795918 5984693877 6436393030 7723671636 7979591836 9654589545 9974489795 11969387754 12872786060 16090982575 19309179090 19948979590 23938775508 29923469385 32181965150 38618358180 39897959180 48272947725 49872448975 59846938770 64363930300 96545895450 99744897950 119693877540 149617346925 193091790900 199489795900 299234693850 598469387700 1003433673377 2006867346754 3010301020131 4013734693508 5017168366885 6020602040262 10034336733770 12041204080524 15051505100655 20068673467540 25085841834425 30103010201310 50171683668850 60206020402620 75257525503275 100343367337700 150515051006550 301030102013100