Base | Representation |
---|---|
bin | 1100100010001001100… |
… | …0100100111110010000 |
3 | 202120210101102012001010 |
4 | 3020202120210332100 |
5 | 12011441224424130 |
6 | 242530303010520 |
7 | 21361650165501 |
oct | 3104230447620 |
9 | 676711365033 |
10 | 215325233040 |
11 | 83356531655 |
12 | 35893b99a40 |
13 | 173c735c2c8 |
14 | a5c95a6ba8 |
15 | 5903ace0b0 |
hex | 3222624f90 |
215325233040 has 40 divisors (see below), whose sum is σ = 667508223168. Its totient is φ = 57420062080.
The previous prime is 215325233021. The next prime is 215325233047. The reversal of 215325233040 is 40332523512.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 215325232989 and 215325233007.
It is not an unprimeable number, because it can be changed into a prime (215325233047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 448593996 + ... + 448594475.
Almost surely, 2215325233040 is an apocalyptic number.
215325233040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
215325233040 is an abundant number, since it is smaller than the sum of its proper divisors (452182990128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215325233040 is a wasteful number, since it uses less digits than its factorization.
215325233040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897188487 (or 897188481 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 215325233040 its reverse (40332523512), we get a palindrome (255657756552).
The spelling of 215325233040 in words is "two hundred fifteen billion, three hundred twenty-five million, two hundred thirty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •