Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …01110011011010001000111 |
3 | 20121210211220120221001020201 |
4 | 23132320232032123101013 |
5 | 23104402022224000012 |
6 | 255223501203311331 |
7 | 13431401611565035 |
oct | 1336705616332107 |
9 | 217724816831221 |
10 | 50501001000007 |
11 | 15100399562718 |
12 | 57b752307b547 |
13 | 22242bb06b13c |
14 | c68393759555 |
15 | 5c89a85c0857 |
hex | 2dee2e39b447 |
50501001000007 has 8 divisors (see below), whose sum is σ = 53169952232960. Its totient is φ = 47833150148280.
The previous prime is 50501000999989. The next prime is 50501001000011. The reversal of 50501001000007 is 70000010010505.
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 50501001000007 - 27 = 50501000999879 is a prime.
It is a super-3 number, since 3×505010010000073 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50501001000017) 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, 275001093 + ... + 275184670.
It is an arithmetic number, because the mean of its divisors is an integer number (6646244029120).
Almost surely, 250501001000007 is an apocalyptic number.
50501001000007 is a deficient number, since it is larger than the sum of its proper divisors (2668951232953).
50501001000007 is a wasteful number, since it uses less digits than its factorization.
50501001000007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550190613.
The product of its (nonzero) digits is 175, while the sum is 19.
The spelling of 50501001000007 in words is "fifty trillion, five hundred one billion, one million, seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •