Base | Representation |
---|---|
bin | 100010010001001000001111… |
… | …0101110010110101100000000 |
3 | 1110112020121010001211220111022 |
4 | 1010202100132232112230000 |
5 | 304001441330444120222 |
6 | 2545023013135005012 |
7 | 120326654210630021 |
oct | 10442203656265400 |
9 | 1415217101756438 |
10 | 301421320301312 |
11 | 880510782aa742 |
12 | 2998157a369768 |
13 | cc25ba70abba3 |
14 | 5460c26810c48 |
15 | 24ca9d85da042 |
hex | 112241eb96b00 |
301421320301312 has 36 divisors (see below), whose sum is σ = 601667646190296. Its totient is φ = 150710050805760.
The previous prime is 301421320301267. The next prime is 301421320301329. The reversal of 301421320301312 is 213103023124103.
It is a happy number.
It is a super-3 number, since 3×3014213203013123 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 64751183 + ... + 69249969.
Almost surely, 2301421320301312 is an apocalyptic number.
301421320301312 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
301421320301312 is a deficient number, since it is larger than the sum of its proper divisors (300246325888984).
301421320301312 is an equidigital number, since it uses as much as digits as its factorization.
301421320301312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4760524 (or 4760510 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 301421320301312 its reverse (213103023124103), we get a palindrome (514524343425415).
The spelling of 301421320301312 in words is "three hundred one trillion, four hundred twenty-one billion, three hundred twenty million, three hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •