Base | Representation |
---|---|
bin | 1000110001011101100… |
… | …00101110000001110111 |
3 | 1001211001022221001120122 |
4 | 10120232300232001313 |
5 | 14414313122442403 |
6 | 350250454522155 |
7 | 30530525500100 |
oct | 4305660560167 |
9 | 1054038831518 |
10 | 301432234103 |
11 | 106922701a50 |
12 | 4a50506635b |
13 | 2256a785200 |
14 | 108374453a7 |
15 | 7c932be838 |
hex | 462ec2e077 |
301432234103 has 72 divisors (see below), whose sum is σ = 421238828160. Its totient is φ = 213135773760.
The previous prime is 301432234073. The next prime is 301432234127.
301432234103 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 301432234103 - 26 = 301432234039 is a prime.
It is a super-2 number, since 2×3014322341032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301432234183) 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 71 ways as a sum of consecutive naturals, for example, 5346326 + ... + 5402412.
It is an arithmetic number, because the mean of its divisors is an integer number (5850539280).
Almost surely, 2301432234103 is an apocalyptic number.
301432234103 is a deficient number, since it is larger than the sum of its proper divisors (119806594057).
301432234103 is a wasteful number, since it uses less digits than its factorization.
301432234103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56197 (or 56177 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
It can be divided in two parts, 301432 and 234103, that added together give a palindrome (535535).
The spelling of 301432234103 in words is "three hundred one billion, four hundred thirty-two million, two hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •