Base | Representation |
---|---|
bin | 1111100010110… |
… | …11111111110001 |
3 | 100002101000111120 |
4 | 13301123333301 |
5 | 231340301431 |
6 | 20534532453 |
7 | 3142245426 |
oct | 761337761 |
9 | 302330446 |
10 | 130400241 |
11 | 676756a4 |
12 | 37807129 |
13 | 21028a0a |
14 | 13465d4d |
15 | b6ac196 |
hex | 7c5bff1 |
130400241 has 4 divisors (see below), whose sum is σ = 173866992. Its totient is φ = 86933492.
The previous prime is 130400203. The next prime is 130400261. The reversal of 130400241 is 142004031.
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 130400241 - 225 = 96845809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130400241.
It is not an unprimeable number, because it can be changed into a prime (130400261) 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, 21733371 + ... + 21733376.
It is an arithmetic number, because the mean of its divisors is an integer number (43466748).
Almost surely, 2130400241 is an apocalyptic number.
It is an amenable number.
130400241 is a deficient number, since it is larger than the sum of its proper divisors (43466751).
130400241 is an equidigital number, since it uses as much as digits as its factorization.
130400241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43466750.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 130400241 is about 11419.2924912185. The cubic root of 130400241 is about 507.0990512526.
Adding to 130400241 its reverse (142004031), we get a palindrome (272404272).
The spelling of 130400241 in words is "one hundred thirty million, four hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •