Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …00010011000000010110101 |
3 | 20120000221202022120120101111 |
4 | 23113212020202120002311 |
5 | 23023200002240133433 |
6 | 254201404000355021 |
7 | 13350244510106314 |
oct | 1327461042300265 |
9 | 216027668516344 |
10 | 50000005005493 |
11 | 14a27979367864 |
12 | 5736404615a71 |
13 | 21b8c987863ca |
14 | c4c02814c27b |
15 | 5ba9352ecdcd |
hex | 2d79888980b5 |
50000005005493 has 8 divisors (see below), whose sum is σ = 52952325022080. Its totient is φ = 47048923128000.
The previous prime is 50000005005481. The next prime is 50000005005499. The reversal of 50000005005493 is 39450050000005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50000005005493 is a prime.
It is a super-3 number, since 3×500000050054933 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50000005005499) 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, 309451623 + ... + 309613156.
It is an arithmetic number, because the mean of its divisors is an integer number (6619040627760).
Almost surely, 250000005005493 is an apocalyptic number.
It is an amenable number.
50000005005493 is a deficient number, since it is larger than the sum of its proper divisors (2952320016587).
50000005005493 is a wasteful number, since it uses less digits than its factorization.
50000005005493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619069547.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 50000005005493 its reverse (39450050000005), we get a palindrome (89450055005498).
The spelling of 50000005005493 in words is "fifty trillion, five million, five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •