Base | Representation |
---|---|
bin | 1000110000101100100… |
… | …00000001110001001100 |
3 | 1001202222200010202120002 |
4 | 10120112100001301030 |
5 | 14412442334323040 |
6 | 350142004543432 |
7 | 30514403243012 |
oct | 4302620016114 |
9 | 1052880122502 |
10 | 301021011020 |
11 | 106731570a64 |
12 | 4a40b3b1b78 |
13 | 22503514442 |
14 | 107d899c8b2 |
15 | 7c6c140a15 |
hex | 4616401c4c |
301021011020 has 12 divisors (see below), whose sum is σ = 632144123184. Its totient is φ = 120408404400.
The previous prime is 301021010993. The next prime is 301021011029. The reversal of 301021011020 is 20110120103.
It is a super-2 number, since 2×3010210110202 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301021010992 and 301021011010.
It is not an unprimeable number, because it can be changed into a prime (301021011029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7525525256 + ... + 7525525295.
It is an arithmetic number, because the mean of its divisors is an integer number (52678676932).
Almost surely, 2301021011020 is an apocalyptic number.
It is an amenable number.
301021011020 is an abundant number, since it is smaller than the sum of its proper divisors (331123112164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301021011020 is a wasteful number, since it uses less digits than its factorization.
301021011020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15051050560 (or 15051050558 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 301021011020 its reverse (20110120103), we get a palindrome (321131131123).
The spelling of 301021011020 in words is "three hundred one billion, twenty-one million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •