Base | Representation |
---|---|
bin | 110100100001100000101010… |
… | …010000110100011101101011 |
3 | 1010021220111112220101210222002 |
4 | 310201200222100310131223 |
5 | 220234211004401202311 |
6 | 2135144300004321215 |
7 | 66441200553315305 |
oct | 6441405220643553 |
9 | 1107814486353862 |
10 | 231001230100331 |
11 | 67671087224939 |
12 | 21aa97046a320b |
13 | 9bb8426799982 |
14 | 410873a940975 |
15 | 1ba8d135b393b |
hex | d2182a43476b |
231001230100331 has 4 divisors (see below), whose sum is σ = 231001300681464. Its totient is φ = 231001159519200.
The previous prime is 231001230100301. The next prime is 231001230100367. The reversal of 231001230100331 is 133001032100132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231001230100331 is a prime.
It is a super-2 number, since 2×2310012301003312 (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 (231001230100301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30129725 + ... + 37010846.
It is an arithmetic number, because the mean of its divisors is an integer number (57750325170366).
Almost surely, 2231001230100331 is an apocalyptic number.
231001230100331 is a deficient number, since it is larger than the sum of its proper divisors (70581133).
231001230100331 is an equidigital number, since it uses as much as digits as its factorization.
231001230100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70581132.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 231001230100331 its reverse (133001032100132), we get a palindrome (364002262200463).
The spelling of 231001230100331 in words is "two hundred thirty-one trillion, one billion, two hundred thirty million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •