Base | Representation |
---|---|
bin | 101100011100011… |
… | …010010001100000 |
3 | 1220222001200212010 |
4 | 230130122101200 |
5 | 3011341121102 |
6 | 201553432520 |
7 | 24322610400 |
oct | 5434322140 |
9 | 1828050763 |
10 | 745645152 |
11 | 35299626a |
12 | 18986b740 |
13 | bb631565 |
14 | 7105a800 |
15 | 456dbd6c |
hex | 2c71a460 |
745645152 has 144 divisors (see below), whose sum is σ = 2288874672. Its totient is φ = 211921920.
The previous prime is 745645123. The next prime is 745645163. The reversal of 745645152 is 251546547.
It is a super-2 number, since 2×7456451522 = 1111973385402206208, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 745645152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1378002 + ... + 1378542.
It is an arithmetic number, because the mean of its divisors is an integer number (15894963).
Almost surely, 2745645152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 745645152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1144437336).
745645152 is an abundant number, since it is smaller than the sum of its proper divisors (1543229520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
745645152 is a wasteful number, since it uses less digits than its factorization.
745645152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 861 (or 846 counting only the distinct ones).
The product of its digits is 168000, while the sum is 39.
The square root of 745645152 is about 27306.5038406604. The cubic root of 745645152 is about 906.7983742729.
The spelling of 745645152 in words is "seven hundred forty-five million, six hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •