Base | Representation |
---|---|
bin | 1011011100000101… |
… | …11011110001111001 |
3 | 120211222210211002102 |
4 | 11232002323301321 |
5 | 100034123331301 |
6 | 2453215513145 |
7 | 305120411141 |
oct | 55602736171 |
9 | 16758724072 |
10 | 6141230201 |
11 | 2671623167 |
12 | 12348287b5 |
13 | 76b417032 |
14 | 423893921 |
15 | 25e233b6b |
hex | 16e0bbc79 |
6141230201 has 4 divisors (see below), whose sum is σ = 6284049552. Its totient is φ = 5998410852.
The previous prime is 6141230197. The next prime is 6141230209. The reversal of 6141230201 is 1020321416.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6141230201 - 22 = 6141230197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6141230209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71409611 + ... + 71409696.
It is an arithmetic number, because the mean of its divisors is an integer number (1571012388).
Almost surely, 26141230201 is an apocalyptic number.
It is an amenable number.
6141230201 is a deficient number, since it is larger than the sum of its proper divisors (142819351).
6141230201 is a wasteful number, since it uses less digits than its factorization.
6141230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142819350.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 6141230201 is about 78366.0015631779. The cubic root of 6141230201 is about 1831.2675185595.
Adding to 6141230201 its reverse (1020321416), we get a palindrome (7161551617).
The spelling of 6141230201 in words is "six billion, one hundred forty-one million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •