Base | Representation |
---|---|
bin | 111100001101011… |
… | …001010111100101 |
3 | 2121101202200002012 |
4 | 330031121113211 |
5 | 4032044112431 |
6 | 244122524005 |
7 | 34014042254 |
oct | 7415312745 |
9 | 2541680065 |
10 | 1010144741 |
11 | 479222771 |
12 | 242366605 |
13 | 13137c8a8 |
14 | 9822c79b |
15 | 5da3722b |
hex | 3c3595e5 |
1010144741 has 4 divisors (see below), whose sum is σ = 1016342112. Its totient is φ = 1003947372.
The previous prime is 1010144719. The next prime is 1010144753. The reversal of 1010144741 is 1474410101.
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 1010144741 - 26 = 1010144677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010144771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3098441 + ... + 3098766.
It is an arithmetic number, because the mean of its divisors is an integer number (254085528).
Almost surely, 21010144741 is an apocalyptic number.
It is an amenable number.
1010144741 is a deficient number, since it is larger than the sum of its proper divisors (6197371).
1010144741 is an equidigital number, since it uses as much as digits as its factorization.
1010144741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6197370.
The product of its (nonzero) digits is 448, while the sum is 23.
The square root of 1010144741 is about 31782.7742810473. The cubic root of 1010144741 is about 1003.3702092629.
Adding to 1010144741 its reverse (1474410101), we get a palindrome (2484554842).
The spelling of 1010144741 in words is "one billion, ten million, one hundred forty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •