Base | Representation |
---|---|
bin | 1101011100101010001… |
… | …0100000111010000000 |
3 | 211002022222011122222021 |
4 | 3113022202200322000 |
5 | 12241123003441000 |
6 | 254045002451224 |
7 | 22456112515246 |
oct | 3271242407200 |
9 | 732288148867 |
10 | 231031312000 |
11 | 89a861751a5 |
12 | 38937b03b14 |
13 | 18a2b265658 |
14 | b2794a8796 |
15 | 60228b711a |
hex | 35ca8a0e80 |
231031312000 has 64 divisors (see below), whose sum is σ = 574401639240. Its totient is φ = 92412518400.
The previous prime is 231031311947. The next prime is 231031312007. The reversal of 231031312000 is 213130132.
It can be written as a sum of positive squares in 4 ways, for example, as 151358346304 + 79672965696 = 389048^2 + 282264^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (231031312007) 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, 7203729 + ... + 7235728.
Almost surely, 2231031312000 is an apocalyptic number.
231031312000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231031312000 is an abundant number, since it is smaller than the sum of its proper divisors (343370327240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231031312000 is an equidigital number, since it uses as much as digits as its factorization.
231031312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14439486 (or 14439464 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 231031312000 its reverse (213130132), we get a palindrome (231244442132).
The spelling of 231031312000 in words is "two hundred thirty-one billion, thirty-one million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •