Base | Representation |
---|---|
bin | 1000000000000000… |
… | …10100111101100000 |
3 | 102002022220022021200 |
4 | 10000000110331200 |
5 | 32244013200102 |
6 | 1550105521200 |
7 | 211302230565 |
oct | 40000247540 |
9 | 12068808250 |
10 | 4295053152 |
11 | 190449a005 |
12 | 9ba4a3200 |
13 | 535aa9990 |
14 | 2ca5da86c |
15 | 1a210851c |
hex | 100014f60 |
4295053152 has 72 divisors (see below), whose sum is σ = 13153611744. Its totient is φ = 1321553664.
The previous prime is 4295053141. The next prime is 4295053163. The reversal of 4295053152 is 2513505924.
It is a happy number.
4295053152 is a `hidden beast` number, since 4 + 29 + 50 + 531 + 52 = 666.
It is an interprime number because it is at equal distance from previous prime (4295053141) and next prime (4295053163).
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 569848 + ... + 577335.
It is an arithmetic number, because the mean of its divisors is an integer number (182689052).
Almost surely, 24295053152 is an apocalyptic number.
It is an amenable number.
4295053152 is an abundant number, since it is smaller than the sum of its proper divisors (8858558592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4295053152 is a wasteful number, since it uses less digits than its factorization.
4295053152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147212 (or 1147201 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 4295053152 is about 65536.6550260234. The cubic root of 4295053152 is about 1625.5095083328.
The spelling of 4295053152 in words is "four billion, two hundred ninety-five million, fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •