Base | Representation |
---|---|
bin | 101101011001011… |
… | …0011100111100100 |
3 | 10221011022000221212 |
4 | 1122302303213210 |
5 | 11104424034233 |
6 | 411052530552 |
7 | 52514364530 |
oct | 13262634744 |
9 | 3834260855 |
10 | 1523268068 |
11 | 711932933 |
12 | 366180a58 |
13 | 1b377b06a |
14 | 10643cbc0 |
15 | 8dae3a48 |
hex | 5acb39e4 |
1523268068 has 48 divisors (see below), whose sum is σ = 3247259904. Its totient is φ = 610329600.
The previous prime is 1523268067. The next prime is 1523268079. The reversal of 1523268068 is 8608623251.
It is not an unprimeable number, because it can be changed into a prime (1523268067) 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 15 ways as a sum of consecutive naturals, for example, 61280 + ... + 82472.
It is an arithmetic number, because the mean of its divisors is an integer number (67651248).
Almost surely, 21523268068 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 1523268068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1623629952).
1523268068 is an abundant number, since it is smaller than the sum of its proper divisors (1723991836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1523268068 is a wasteful number, since it uses less digits than its factorization.
1523268068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21372 (or 21370 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 41.
The square root of 1523268068 is about 39029.0669629700. The cubic root of 1523268068 is about 1150.6028516565.
The spelling of 1523268068 in words is "one billion, five hundred twenty-three million, two hundred sixty-eight thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •