Base | Representation |
---|---|
bin | 111101111001000111010… |
… | …000001000010010000001 |
3 | 120001121021201200120112220 |
4 | 331321013100020102001 |
5 | 1024141040014033401 |
6 | 13013522112041253 |
7 | 616166404165560 |
oct | 75710720102201 |
9 | 16047251616486 |
10 | 4253213033601 |
11 | 139a860970594 |
12 | 588374533229 |
13 | 24b0cb73a72c |
14 | 109bdc76dbd7 |
15 | 75980de9336 |
hex | 3de47408481 |
4253213033601 has 32 divisors (see below), whose sum is σ = 6526142776320. Its totient is φ = 2413544088384.
The previous prime is 4253213033599. The next prime is 4253213033639. The reversal of 4253213033601 is 1063303123524.
4253213033601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4253213033601 - 21 = 4253213033599 is a prime.
It is a super-2 number, since 2×42532130336012 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4253213013601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2439306 + ... + 3802188.
It is an arithmetic number, because the mean of its divisors is an integer number (203941961760).
Almost surely, 24253213033601 is an apocalyptic number.
It is an amenable number.
4253213033601 is a deficient number, since it is larger than the sum of its proper divisors (2272929742719).
4253213033601 is a wasteful number, since it uses less digits than its factorization.
4253213033601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363925.
The product of its (nonzero) digits is 38880, while the sum is 33.
The spelling of 4253213033601 in words is "four trillion, two hundred fifty-three billion, two hundred thirteen million, thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •