Base | Representation |
---|---|
bin | 10000101101101… |
… | …00110101110011 |
3 | 100202210222001220 |
4 | 20112310311303 |
5 | 241342420311 |
6 | 21525000123 |
7 | 3321456144 |
oct | 1026646563 |
9 | 322728056 |
10 | 140201331 |
11 | 7215a376 |
12 | 3ab53043 |
13 | 2307ab8a |
14 | 14897acb |
15 | c496206 |
hex | 85b4d73 |
140201331 has 8 divisors (see below), whose sum is σ = 187000464. Its totient is φ = 93434880.
The previous prime is 140201317. The next prime is 140201389. The reversal of 140201331 is 133102041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140201331 - 26 = 140201267 is a prime.
It is a super-2 number, since 2×1402013312 = 39312826428343122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140201331.
It is not an unprimeable number, because it can be changed into a prime (140201311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4771 + ... + 17411.
It is an arithmetic number, because the mean of its divisors is an integer number (23375058).
Almost surely, 2140201331 is an apocalyptic number.
140201331 is a deficient number, since it is larger than the sum of its proper divisors (46799133).
140201331 is a wasteful number, since it uses less digits than its factorization.
140201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16341.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 140201331 is about 11840.6642972428. The cubic root of 140201331 is about 519.4981981143.
Adding to 140201331 its reverse (133102041), we get a palindrome (273303372).
It can be divided in two parts, 14020 and 1331, that added together give a palindrome (15351).
The spelling of 140201331 in words is "one hundred forty million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •