Base | Representation |
---|---|
bin | 11101000100010001… |
… | …100101110010111100 |
3 | 2222120002120002222022 |
4 | 131010101211302330 |
5 | 1002404304424040 |
6 | 22200543335312 |
7 | 2153263414001 |
oct | 350421456274 |
9 | 88502502868 |
10 | 31210233020 |
11 | 122663aa00a |
12 | 60702b1538 |
13 | 2c35030205 |
14 | 172107d8a8 |
15 | c29ed66b5 |
hex | 744465cbc |
31210233020 has 48 divisors (see below), whose sum is σ = 69483264480. Its totient is φ = 11735107584.
The previous prime is 31210232993. The next prime is 31210233023. The reversal of 31210233020 is 2033201213.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 31210233020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31210233023) 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, 218327 + ... + 331793.
It is an arithmetic number, because the mean of its divisors is an integer number (1447568010).
Almost surely, 231210233020 is an apocalyptic number.
It is an amenable number.
31210233020 is an abundant number, since it is smaller than the sum of its proper divisors (38273031460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31210233020 is a wasteful number, since it uses less digits than its factorization.
31210233020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114302 (or 114300 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 31210233020 its reverse (2033201213), we get a palindrome (33243434233).
The spelling of 31210233020 in words is "thirty-one billion, two hundred ten million, two hundred thirty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •