Base | Representation |
---|---|
bin | 100101101001000100100111… |
… | …0001010000100100000110011 |
3 | 1121102022212211222200120012220 |
4 | 1023102021032022010200303 |
5 | 321344221444032031121 |
6 | 3132105221342452123 |
7 | 126512132041614303 |
oct | 11322111612044063 |
9 | 1542285758616186 |
10 | 331100340111411 |
11 | 96553958252282 |
12 | 31175569b94043 |
13 | 11299821c22590 |
14 | 5ba94b0501603 |
15 | 2842a2ddbc6c6 |
hex | 12d224e284833 |
331100340111411 has 8 divisors (see below), whose sum is σ = 475426129390800. Its totient is φ = 203754055453152.
The previous prime is 331100340111347. The next prime is 331100340111461. The reversal of 331100340111411 is 114111043001133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 331100340111411 - 26 = 331100340111347 is a prime.
It is not an unprimeable number, because it can be changed into a prime (331100340111461) 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 7 ways as a sum of consecutive naturals, for example, 4244876155236 + ... + 4244876155313.
It is an arithmetic number, because the mean of its divisors is an integer number (59428266173850).
Almost surely, 2331100340111411 is an apocalyptic number.
331100340111411 is a deficient number, since it is larger than the sum of its proper divisors (144325789279389).
331100340111411 is a wasteful number, since it uses less digits than its factorization.
331100340111411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8489752310565.
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 331100340111411 its reverse (114111043001133), we get a palindrome (445211383112544).
The spelling of 331100340111411 in words is "three hundred thirty-one trillion, one hundred billion, three hundred forty million, one hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •