Base | Representation |
---|---|
bin | 110001010111111111… |
… | …0001110100000000111 |
3 | 101010200112001022222122 |
4 | 1202233332032200013 |
5 | 3214123033241411 |
6 | 120413223520155 |
7 | 10442363135621 |
oct | 1425776164007 |
9 | 333615038878 |
10 | 106031540231 |
11 | 40a710495a1 |
12 | 186718b905b |
13 | 9cca29c566 |
14 | 51bc11dc11 |
15 | 2b58a029db |
hex | 18aff8e807 |
106031540231 has 4 divisors (see below), whose sum is σ = 107769762264. Its totient is φ = 104293318200.
The previous prime is 106031540213. The next prime is 106031540233. The reversal of 106031540231 is 132045130601.
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-106031540231 is a prime.
It is a super-2 number, since 2×1060315402312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106031540231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106031540233) 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, 869110925 + ... + 869111046.
It is an arithmetic number, because the mean of its divisors is an integer number (26942440566).
Almost surely, 2106031540231 is an apocalyptic number.
106031540231 is a deficient number, since it is larger than the sum of its proper divisors (1738222033).
106031540231 is an equidigital number, since it uses as much as digits as its factorization.
106031540231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1738222032.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 106031540231 its reverse (132045130601), we get a palindrome (238076670832).
The spelling of 106031540231 in words is "one hundred six billion, thirty-one million, five hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •