Base | Representation |
---|---|
bin | 100100110011110… |
… | …0001100101100000 |
3 | 10012002001110212121 |
4 | 1021213201211200 |
5 | 10012141113302 |
6 | 322320234024 |
7 | 42415105444 |
oct | 11147414540 |
9 | 3162043777 |
10 | 1235097952 |
11 | 5841a9410 |
12 | 2a576b914 |
13 | 168b629ba |
14 | ba068824 |
15 | 7366ee37 |
hex | 499e1960 |
1235097952 has 48 divisors (see below), whose sum is σ = 2670570000. Its totient is φ = 557616640.
The previous prime is 1235097911. The next prime is 1235097967. The reversal of 1235097952 is 2597905321.
It is a junction number, because it is equal to n+sod(n) for n = 1235097899 and 1235097908.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40674 + ... + 64222.
It is an arithmetic number, because the mean of its divisors is an integer number (55636875).
Almost surely, 21235097952 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 1235097952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1335285000).
1235097952 is an abundant number, since it is smaller than the sum of its proper divisors (1435472048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1235097952 is a wasteful number, since it uses less digits than its factorization.
1235097952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23719 (or 23711 counting only the distinct ones).
The product of its (nonzero) digits is 170100, while the sum is 43.
The square root of 1235097952 is about 35143.9603915097. The cubic root of 1235097952 is about 1072.9194884447.
The spelling of 1235097952 in words is "one billion, two hundred thirty-five million, ninety-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •