Base | Representation |
---|---|
bin | 110100100001111101011100… |
… | …110001001010010000110111 |
3 | 1010022000110100012222200201121 |
4 | 310201331130301022100313 |
5 | 220240212311401210403 |
6 | 2135210411222204411 |
7 | 66443343600030313 |
oct | 6441753461122067 |
9 | 1108013305880647 |
10 | 231032142210103 |
11 | 676831aa3114a3 |
12 | 21ab36b0b83707 |
13 | 9bbb311b083a0 |
14 | 410a030178b43 |
15 | 1ba9a2230c3bd |
hex | d21f5cc4a437 |
231032142210103 has 32 divisors (see below), whose sum is σ = 275996177694720. Its totient is φ = 191341887137280.
The previous prime is 231032142210101. The next prime is 231032142210139. The reversal of 231032142210103 is 301012241230132.
231032142210103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 231032142210103 - 21 = 231032142210101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231032142210101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 251200663 + ... + 252118696.
It is an arithmetic number, because the mean of its divisors is an integer number (8624880552960).
Almost surely, 2231032142210103 is an apocalyptic number.
231032142210103 is a deficient number, since it is larger than the sum of its proper divisors (44964035484617).
231032142210103 is a wasteful number, since it uses less digits than its factorization.
231032142210103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 503319487.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 231032142210103 its reverse (301012241230132), we get a palindrome (532044383440235).
The spelling of 231032142210103 in words is "two hundred thirty-one trillion, thirty-two billion, one hundred forty-two million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •