Base | Representation |
---|---|
bin | 111110000011100011100… |
… | …110111110100000010001 |
3 | 120002200020012020121102220 |
4 | 332003203212332200101 |
5 | 1024332021102000103 |
6 | 13023014513131253 |
7 | 620044312436154 |
oct | 76034346764021 |
9 | 16080205217386 |
10 | 4264426203153 |
11 | 13a4595466866 |
12 | 58a583859b29 |
13 | 24c1978807bc |
14 | 10a583a8dc9b |
15 | 75dda544c53 |
hex | 3e0e39be811 |
4264426203153 has 4 divisors (see below), whose sum is σ = 5685901604208. Its totient is φ = 2842950802100.
The previous prime is 4264426203109. The next prime is 4264426203211. The reversal of 4264426203153 is 3513026244624.
It is a happy number.
4264426203153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4264426203153 - 224 = 4264409425937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4264426203853) 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, 710737700523 + ... + 710737700528.
It is an arithmetic number, because the mean of its divisors is an integer number (1421475401052).
Almost surely, 24264426203153 is an apocalyptic number.
It is an amenable number.
4264426203153 is a deficient number, since it is larger than the sum of its proper divisors (1421475401055).
4264426203153 is a wasteful number, since it uses less digits than its factorization.
4264426203153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421475401054.
The product of its (nonzero) digits is 829440, while the sum is 42.
The spelling of 4264426203153 in words is "four trillion, two hundred sixty-four billion, four hundred twenty-six million, two hundred three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •