Base | Representation |
---|---|
bin | 1101011101010011010… |
… | …1010100001001001011 |
3 | 211002210000010202200111 |
4 | 3113110311110021023 |
5 | 12242001211400434 |
6 | 254114052215151 |
7 | 22463310452506 |
oct | 3272465241113 |
9 | 732700122614 |
10 | 231204012619 |
11 | 8a064701788 |
12 | 3898590a4b7 |
13 | 18a57c81c78 |
14 | b2943c213d |
15 | 6032b2c964 |
hex | 35d4d5424b |
231204012619 has 8 divisors (see below), whose sum is σ = 237382659360. Its totient is φ = 225051057600.
The previous prime is 231204012601. The next prime is 231204012643. The reversal of 231204012619 is 916210402132.
231204012619 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 231204012619 - 27 = 231204012491 is a prime.
It is a super-2 number, since 2×2312040126192 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (231204012659) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6404692 + ... + 6440689.
It is an arithmetic number, because the mean of its divisors is an integer number (29672832420).
Almost surely, 2231204012619 is an apocalyptic number.
231204012619 is a deficient number, since it is larger than the sum of its proper divisors (6178646741).
231204012619 is a wasteful number, since it uses less digits than its factorization.
231204012619 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12845861.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 231204012619 in words is "two hundred thirty-one billion, two hundred four million, twelve thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •