Base | Representation |
---|---|
bin | 100100110110001111010… |
… | …101100011100101010000 |
3 | 22222001220020010122201121 |
4 | 210312033111203211100 |
5 | 312441310433430000 |
6 | 5215125503212024 |
7 | 350640542243464 |
oct | 44661725434520 |
9 | 8861806118647 |
10 | 2532140530000 |
11 | 896969353174 |
12 | 34a8b48a7014 |
13 | 154a1a385c23 |
14 | 8a7b05184a4 |
15 | 45d0060ab1a |
hex | 24d8f563950 |
2532140530000 has 50 divisors (see below), whose sum is σ = 6130565461394. Its totient is φ = 1012856208000.
The previous prime is 2532140529977. The next prime is 2532140530057. The reversal of 2532140530000 is 350412352.
It can be written as a sum of positive squares in 5 ways, for example, as 1444525149456 + 1087615380544 = 1201884^2 + 1042888^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 126597027 + ... + 126617026.
Almost surely, 22532140530000 is an apocalyptic number.
2532140530000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2532140530000 is an abundant number, since it is smaller than the sum of its proper divisors (3598424931394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2532140530000 is an equidigital number, since it uses as much as digits as its factorization.
2532140530000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253214081 (or 253214060 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 2532140530000 its reverse (350412352), we get a palindrome (2532490942352).
The spelling of 2532140530000 in words is "two trillion, five hundred thirty-two billion, one hundred forty million, five hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •