Base | Representation |
---|---|
bin | 110100100001101100111101… |
… | …101101111011011011010011 |
3 | 1010021221202122121210101002221 |
4 | 310201230331231323123103 |
5 | 220234420033444300034 |
6 | 2135154322544321511 |
7 | 66442146133442104 |
oct | 6441547555733323 |
9 | 1107852577711087 |
10 | 231014441400019 |
11 | 676767466aa932 |
12 | 21ab0191013297 |
13 | 9bb9750880c74 |
14 | 41092313903ab |
15 | 1ba9338352bb4 |
hex | d21b3db7b6d3 |
231014441400019 has 4 divisors (see below), whose sum is σ = 231014476640160. Its totient is φ = 231014406159880.
The previous prime is 231014441399921. The next prime is 231014441400077. The reversal of 231014441400019 is 910004144410132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231014441400019 - 219 = 231014440875731 is a prime.
It is a super-2 number, since 2×2310144414000192 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231014441500019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4560379 + ... + 21973300.
It is an arithmetic number, because the mean of its divisors is an integer number (57753619160040).
Almost surely, 2231014441400019 is an apocalyptic number.
231014441400019 is a deficient number, since it is larger than the sum of its proper divisors (35240141).
231014441400019 is an equidigital number, since it uses as much as digits as its factorization.
231014441400019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35240140.
The product of its (nonzero) digits is 13824, while the sum is 34.
The spelling of 231014441400019 in words is "two hundred thirty-one trillion, fourteen billion, four hundred forty-one million, four hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •