Base | Representation |
---|---|
bin | 101101011110100… |
… | …1101101001000000 |
3 | 10221100102122002221 |
4 | 1122331031221000 |
5 | 11111123333341 |
6 | 411231220424 |
7 | 52546516132 |
oct | 13275155100 |
9 | 3840378087 |
10 | 1525996096 |
11 | 7134264a9 |
12 | 367077714 |
13 | 1b41c4991 |
14 | 10694d052 |
15 | 8de81ed1 |
hex | 5af4da40 |
1525996096 has 63 divisors (see below), whose sum is σ = 3208396809. Its totient is φ = 720027648.
The previous prime is 1525996091. The next prime is 1525996103. The reversal of 1525996096 is 6906995251.
The square root of 1525996096 is 39064.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1502337600 + 23658496 = 38760^2 + 4864^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1525996091) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 5937600 + ... + 5937856.
Almost surely, 21525996096 is an apocalyptic number.
1525996096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1525996096 is the 39064-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1525996096
1525996096 is an abundant number, since it is smaller than the sum of its proper divisors (1682400713).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1525996096 is an frugal number, since it uses more digits than its factorization.
1525996096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564 (or 278 counting only the distinct ones).
The product of its (nonzero) digits is 1312200, while the sum is 52.
The cubic root of 1525996096 is about 1151.2893153885.
The spelling of 1525996096 in words is "one billion, five hundred twenty-five million, nine hundred ninety-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •