Base | Representation |
---|---|
bin | 101000011101011… |
… | …1101000111110100 |
3 | 10111121121211222020 |
4 | 1100322331013310 |
5 | 10240023210423 |
6 | 342414433140 |
7 | 45433452516 |
oct | 12072750764 |
9 | 3447554866 |
10 | 1357631988 |
11 | 637391009 |
12 | 31a8027b0 |
13 | 18836614b |
14 | cc443bb6 |
15 | 7e2c64e3 |
hex | 50ebd1f4 |
1357631988 has 48 divisors (see below), whose sum is σ = 3251384640. Its totient is φ = 440757504.
The previous prime is 1357631983. The next prime is 1357632007. The reversal of 1357631988 is 8891367531.
It is a super-2 number, since 2×13576319882 = 3686329229681664288, 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 1357631988.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1357631981) 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, 62070 + ... + 81042.
It is an arithmetic number, because the mean of its divisors is an integer number (67737180).
Almost surely, 21357631988 is an apocalyptic number.
It is an amenable number.
1357631988 is an abundant number, since it is smaller than the sum of its proper divisors (1893752652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1357631988 is a wasteful number, since it uses less digits than its factorization.
1357631988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19136 (or 19134 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 51.
The square root of 1357631988 is about 36846.0579709689. The cubic root of 1357631988 is about 1107.2882396739.
The spelling of 1357631988 in words is "one billion, three hundred fifty-seven million, six hundred thirty-one thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •