Base | Representation |
---|---|
bin | 111011101100011010100… |
… | …111100000000101000111 |
3 | 112112011100012202002101212 |
4 | 323230122213200011013 |
5 | 1014202140411032221 |
6 | 12420255223442035 |
7 | 602240601330512 |
oct | 73543247400507 |
9 | 15464305662355 |
10 | 4102140330311 |
11 | 13417873015a1 |
12 | 5630325b631b |
13 | 239aa3b76cca |
14 | 10278a747d79 |
15 | 71a8d076b5b |
hex | 3bb1a9e0147 |
4102140330311 has 8 divisors (see below), whose sum is σ = 4126643464944. Its totient is φ = 4077657408960.
The previous prime is 4102140330289. The next prime is 4102140330371. The reversal of 4102140330311 is 1130330412014.
4102140330311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4102140330311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4102140330371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4646126 + ... + 5458091.
It is an arithmetic number, because the mean of its divisors is an integer number (515830433118).
Almost surely, 24102140330311 is an apocalyptic number.
4102140330311 is a deficient number, since it is larger than the sum of its proper divisors (24503134633).
4102140330311 is a wasteful number, since it uses less digits than its factorization.
4102140330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10106641.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 4102140330311 its reverse (1130330412014), we get a palindrome (5232470742325).
The spelling of 4102140330311 in words is "four trillion, one hundred two billion, one hundred forty million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •