Base | Representation |
---|---|
bin | 101011101011000010000… |
… | …100001010000001001001 |
3 | 101121220110211002211110111 |
4 | 223223002010022001021 |
5 | 343132320104321441 |
6 | 10214412302514321 |
7 | 426553056645310 |
oct | 53530204120111 |
9 | 11556424084414 |
10 | 3001143042121 |
11 | a5786100a194 |
12 | 4057848959a1 |
13 | 18a0115a0ca3 |
14 | a5382a3b277 |
15 | 530eec7d081 |
hex | 2bac210a049 |
3001143042121 has 4 divisors (see below), whose sum is σ = 3429877762432. Its totient is φ = 2572408321812.
The previous prime is 3001143042091. The next prime is 3001143042133. The reversal of 3001143042121 is 1212403411003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 3001143042121 - 25 = 3001143042089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3001143042092 and 3001143042101.
It is not an unprimeable number, because it can be changed into a prime (3001143022121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214367360145 + ... + 214367360158.
It is an arithmetic number, because the mean of its divisors is an integer number (857469440608).
Almost surely, 23001143042121 is an apocalyptic number.
It is an amenable number.
3001143042121 is a deficient number, since it is larger than the sum of its proper divisors (428734720311).
3001143042121 is an equidigital number, since it uses as much as digits as its factorization.
3001143042121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428734720310.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 3001143042121 its reverse (1212403411003), we get a palindrome (4213546453124).
The spelling of 3001143042121 in words is "three trillion, one billion, one hundred forty-three million, forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •