Base | Representation |
---|---|
bin | 10110000010000010001… |
… | …00110000111011101101 |
3 | 2200100222001100212020221 |
4 | 23001001010300323231 |
5 | 44400322014342031 |
6 | 1335432550011341 |
7 | 105456212635441 |
oct | 13010104607355 |
9 | 2610861325227 |
10 | 757006012141 |
11 | 272054182325 |
12 | 102867946b51 |
13 | 56501839282 |
14 | 288d42b8821 |
15 | 14a58a52a11 |
hex | b041130eed |
757006012141 has 8 divisors (see below), whose sum is σ = 758441559744. Its totient is φ = 755571815040.
The previous prime is 757006012121. The next prime is 757006012151. The reversal of 757006012141 is 141210600757.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 757006012141 - 25 = 757006012109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 757006012097 and 757006012106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (757006012121) 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 7 ways as a sum of consecutive naturals, for example, 788061 + ... + 1461181.
It is an arithmetic number, because the mean of its divisors is an integer number (94805194968).
Almost surely, 2757006012141 is an apocalyptic number.
It is an amenable number.
757006012141 is a deficient number, since it is larger than the sum of its proper divisors (1435547603).
757006012141 is a wasteful number, since it uses less digits than its factorization.
757006012141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675251.
The product of its (nonzero) digits is 11760, while the sum is 34.
Adding to 757006012141 its reverse (141210600757), we get a palindrome (898216612898).
The spelling of 757006012141 in words is "seven hundred fifty-seven billion, six million, twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •