Base | Representation |
---|---|
bin | 1000110000101011100… |
… | …01111011110001000000 |
3 | 1001202222010021222000022 |
4 | 10120111301323301000 |
5 | 14412433324401422 |
6 | 350141123513012 |
7 | 30514246215203 |
oct | 4302561736100 |
9 | 1052863258008 |
10 | 301013122112 |
11 | 1067280729aa |
12 | 4a408828768 |
13 | 225019b1751 |
14 | 107d790793a |
15 | 7c6b5d3342 |
hex | 4615c7bc40 |
301013122112 has 14 divisors (see below), whose sum is σ = 597322914318. Its totient is φ = 150506561024.
The previous prime is 301013122093. The next prime is 301013122117. The reversal of 301013122112 is 211221310103.
It can be written as a sum of positive squares in only one way, i.e., 191409750016 + 109603372096 = 437504^2 + 331064^2 .
It is a super-2 number, since 2×3010131221122 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (301013122117) 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, 2351664953 + ... + 2351665080.
Almost surely, 2301013122112 is an apocalyptic number.
301013122112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
301013122112 is a deficient number, since it is larger than the sum of its proper divisors (296309792206).
301013122112 is an equidigital number, since it uses as much as digits as its factorization.
301013122112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4703330045 (or 4703330035 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 301013122112 its reverse (211221310103), we get a palindrome (512234432215).
The spelling of 301013122112 in words is "three hundred one billion, thirteen million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •