Base | Representation |
---|---|
bin | 101110100100100111… |
… | …011000111000111100 |
3 | 11210002000220210220000 |
4 | 232210213120320330 |
5 | 1304403121213434 |
6 | 34550031154300 |
7 | 3420130430622 |
oct | 564447307074 |
9 | 153060823800 |
10 | 50006429244 |
11 | 1a231364482 |
12 | 9837075990 |
13 | 493c1b1205 |
14 | 25c5525512 |
15 | 147a214b99 |
hex | ba49d8e3c |
50006429244 has 60 divisors (see below), whose sum is σ = 131287940784. Its totient is φ = 16597244736.
The previous prime is 50006429233. The next prime is 50006429273. The reversal of 50006429244 is 44292460005.
50006429244 is a `hidden beast` number, since 5 + 0 + 0 + 0 + 642 + 9 + 2 + 4 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 50006429199 and 50006429208.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 255712 + ... + 406695.
Almost surely, 250006429244 is an apocalyptic number.
50006429244 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
50006429244 is an abundant number, since it is smaller than the sum of its proper divisors (81281511540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50006429244 is a wasteful number, since it uses less digits than its factorization.
50006429244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662656 (or 662645 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 50006429244 its reverse (44292460005), we get a palindrome (94298889249).
The spelling of 50006429244 in words is "fifty billion, six million, four hundred twenty-nine thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •