Base | Representation |
---|---|
bin | 11100111111100011… |
… | …110101100101110110 |
3 | 2222100120201021100100 |
4 | 130333203311211312 |
5 | 1002224032131410 |
6 | 22145040054530 |
7 | 2151313145424 |
oct | 347743654566 |
9 | 88316637310 |
10 | 31131130230 |
11 | 12225790a02 |
12 | 6049904446 |
13 | 2c21825325 |
14 | 171476c114 |
15 | c230ad8c0 |
hex | 73f8f5976 |
31131130230 has 24 divisors (see below), whose sum is σ = 80940938832. Its totient is φ = 8301634704.
The previous prime is 31131130213. The next prime is 31131130237. The reversal of 31131130230 is 3203113113.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31131130237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 172950634 + ... + 172950813.
It is an arithmetic number, because the mean of its divisors is an integer number (3372539118).
Almost surely, 231131130230 is an apocalyptic number.
31131130230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31131130230 is an abundant number, since it is smaller than the sum of its proper divisors (49809808602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31131130230 is a wasteful number, since it uses less digits than its factorization.
31131130230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345901460 (or 345901457 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 31131130230 its reverse (3203113113), we get a palindrome (34334243343).
The spelling of 31131130230 in words is "thirty-one billion, one hundred thirty-one million, one hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •