Base | Representation |
---|---|
bin | 111010001110101110000… |
… | …101111100011001000001 |
3 | 112011112122212201101000202 |
4 | 322032232011330121001 |
5 | 1011030121022034431 |
6 | 12302140245454545 |
7 | 562046530144166 |
oct | 72165605743101 |
9 | 15145585641022 |
10 | 4001535346241 |
11 | 1303050423a64 |
12 | 547636111455 |
13 | 23045cc15234 |
14 | db96520406d |
15 | 6e150b878cb |
hex | 3a3ae17c641 |
4001535346241 has 8 divisors (see below), whose sum is σ = 4025038535424. Its totient is φ = 3978036443920.
The previous prime is 4001535346213. The next prime is 4001535346267. The reversal of 4001535346241 is 1426435351004.
4001535346241 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 not a de Polignac number, because 4001535346241 - 230 = 4000461604417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4001535346195 and 4001535346204.
It is not an unprimeable number, because it can be changed into a prime (4001535346141) 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, 810326 + ... + 2942736.
It is an arithmetic number, because the mean of its divisors is an integer number (503129816928).
Almost surely, 24001535346241 is an apocalyptic number.
It is an amenable number.
4001535346241 is a deficient number, since it is larger than the sum of its proper divisors (23503189183).
4001535346241 is a wasteful number, since it uses less digits than its factorization.
4001535346241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2143431.
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 4001535346241 in words is "four trillion, one billion, five hundred thirty-five million, three hundred forty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •