Base | Representation |
---|---|
bin | 1101011101101100101… |
… | …0000101100011110000 |
3 | 211010001101210122021221 |
4 | 3113123022011203300 |
5 | 12242210342334300 |
6 | 254132402354424 |
7 | 22466036406124 |
oct | 3273312054360 |
9 | 733041718257 |
10 | 231310121200 |
11 | 8a109595724 |
12 | 389b535ba14 |
13 | 18a73c54002 |
14 | b2a4523584 |
15 | 603c0dc31a |
hex | 35db2858f0 |
231310121200 has 60 divisors (see below), whose sum is σ = 564832831768. Its totient is φ = 91007251200.
The previous prime is 231310121137. The next prime is 231310121213. The reversal of 231310121200 is 2121013132.
231310121200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4715562 + ... + 4764361.
Almost surely, 2231310121200 is an apocalyptic number.
231310121200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231310121200 is an abundant number, since it is smaller than the sum of its proper divisors (333522710568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231310121200 is a wasteful number, since it uses less digits than its factorization.
231310121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9480002 (or 9479991 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 231310121200 its reverse (2121013132), we get a palindrome (233431134332).
The spelling of 231310121200 in words is "two hundred thirty-one billion, three hundred ten million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •