Base | Representation |
---|---|
bin | 111101100111010110111… |
… | …111111010111000010001 |
3 | 112222210002011222101011101 |
4 | 331213112333322320101 |
5 | 1023333014331221100 |
6 | 13001050330144401 |
7 | 614623116016501 |
oct | 75472677727021 |
9 | 15883064871141 |
10 | 4234149867025 |
11 | 1392769241371 |
12 | 584734282101 |
13 | 249381184900 |
14 | 108d10a71a01 |
15 | 7521753386a |
hex | 3d9d6ffae11 |
4234149867025 has 27 divisors (see below), whose sum is σ = 5685465322611. Its totient is φ = 3126658055040.
The previous prime is 4234149866987. The next prime is 4234149867047. The reversal of 4234149867025 is 5207689414324.
The square root of 4234149867025 is 2057705.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 3991392635409 + 242757231616 = 1997847^2 + 492704^2 .
It is not a de Polignac number, because 4234149867025 - 27 = 4234149866897 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 133734997 + ... + 133766653.
It is a 1-persistent number, because it is pandigital, but 2⋅4234149867025 = 8468299734050 is not.
Almost surely, 24234149867025 is an apocalyptic number.
4234149867025 is the 2057705-th square number.
4234149867025 is the 1028853-rd centered octagonal number.
It is an amenable number.
4234149867025 is a deficient number, since it is larger than the sum of its proper divisors (1451315455586).
4234149867025 is an frugal number, since it uses more digits than its factorization.
4234149867025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63350 (or 31675 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 55.
The spelling of 4234149867025 in words is "four trillion, two hundred thirty-four billion, one hundred forty-nine million, eight hundred sixty-seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •