Base | Representation |
---|---|
bin | 111011101100011010101… |
… | …101111010101110100001 |
3 | 112112011100022220112200112 |
4 | 323230122231322232201 |
5 | 1014202141323343241 |
6 | 12420255323501105 |
7 | 602240621534363 |
oct | 73543255725641 |
9 | 15464308815615 |
10 | 4102142012321 |
11 | 1341788250291 |
12 | 563033087795 |
13 | 239aa4315792 |
14 | 10278aa64d33 |
15 | 71a8d2aa1eb |
hex | 3bb1ab7aba1 |
4102142012321 has 4 divisors (see below), whose sum is σ = 4343444483652. Its totient is φ = 3860839540992.
The previous prime is 4102142012317. The next prime is 4102142012377. The reversal of 4102142012321 is 1232102412014.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3228889141921 + 873252870400 = 1796911^2 + 934480^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102142012321 - 22 = 4102142012317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4102142062321) 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, 120651235640 + ... + 120651235673.
It is an arithmetic number, because the mean of its divisors is an integer number (1085861120913).
Almost surely, 24102142012321 is an apocalyptic number.
It is an amenable number.
4102142012321 is a deficient number, since it is larger than the sum of its proper divisors (241302471331).
4102142012321 is a wasteful number, since it uses less digits than its factorization.
4102142012321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241302471330.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 4102142012321 its reverse (1232102412014), we get a palindrome (5334244424335).
The spelling of 4102142012321 in words is "four trillion, one hundred two billion, one hundred forty-two million, twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •