Base | Representation |
---|---|
bin | 111010001101100110110… |
… | …110001110011001000011 |
3 | 112011102120120112200200121 |
4 | 322031212312032121003 |
5 | 1011020144022341311 |
6 | 12301421510201111 |
7 | 562005104221102 |
oct | 72154666163103 |
9 | 15142516480617 |
10 | 4000340043331 |
11 | 1302597736215 |
12 | 547361953197 |
13 | 2302cc3a69c8 |
14 | db890578039 |
15 | 6e0d0c78b71 |
hex | 3a366d8e643 |
4000340043331 has 4 divisors (see below), whose sum is σ = 4000391632600. Its totient is φ = 4000288454064.
The previous prime is 4000340043289. The next prime is 4000340043341. The reversal of 4000340043331 is 1333400430004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4000340043331 - 29 = 4000340042819 is a prime.
It is a super-2 number, since 2×40003400433312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4000340043296 and 4000340043305.
It is not an unprimeable number, because it can be changed into a prime (4000340043341) 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, 25678146 + ... + 25833463.
It is an arithmetic number, because the mean of its divisors is an integer number (1000097908150).
Almost surely, 24000340043331 is an apocalyptic number.
4000340043331 is a deficient number, since it is larger than the sum of its proper divisors (51589269).
4000340043331 is an equidigital number, since it uses as much as digits as its factorization.
4000340043331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51589268.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 4000340043331 its reverse (1333400430004), we get a palindrome (5333740473335).
The spelling of 4000340043331 in words is "four trillion, three hundred forty million, forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •