Base | Representation |
---|---|
bin | 1101011100100010111… |
… | …0111110001000100101 |
3 | 211002020212011211021221 |
4 | 3113020232332020211 |
5 | 12241042230214023 |
6 | 254042001340341 |
7 | 22455264204205 |
oct | 3271056761045 |
9 | 732225154257 |
10 | 231001023013 |
11 | 89a70067682 |
12 | 389299376b1 |
13 | 18a24bbbc87 |
14 | b275462405 |
15 | 601edd285d |
hex | 35c8bbe225 |
231001023013 has 4 divisors (see below), whose sum is σ = 236635194348. Its totient is φ = 225366851680.
The previous prime is 231001022953. The next prime is 231001023079. The reversal of 231001023013 is 310320100132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53542720449 + 177458302564 = 231393^2 + 421258^2 .
It is not a de Polignac number, because 231001023013 - 213 = 231001014821 is a prime.
It is a super-2 number, since 2×2310010230132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231001023083) 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, 2817085606 + ... + 2817085687.
It is an arithmetic number, because the mean of its divisors is an integer number (59158798587).
Almost surely, 2231001023013 is an apocalyptic number.
It is an amenable number.
231001023013 is a deficient number, since it is larger than the sum of its proper divisors (5634171335).
231001023013 is an equidigital number, since it uses as much as digits as its factorization.
231001023013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5634171334.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 231001023013 its reverse (310320100132), we get a palindrome (541321123145).
The spelling of 231001023013 in words is "two hundred thirty-one billion, one million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •