Base | Representation |
---|---|
bin | 100101011001101111110… |
… | …1110010000111001111010 |
3 | 200012102121200020221022100 |
4 | 1022303133232100321322 |
5 | 1133210303242124200 |
6 | 14533310123004230 |
7 | 1040251142611554 |
oct | 112633756207172 |
9 | 20172550227270 |
10 | 5140534333050 |
11 | 17020a7687a66 |
12 | 6b032a669676 |
13 | 2b399a56c65c |
14 | 13ab35d464d4 |
15 | 8dab52ddd00 |
hex | 4acdfb90e7a |
5140534333050 has 72 divisors (see below), whose sum is σ = 13819717731456. Its totient is φ = 1369934169120.
The previous prime is 5140534333049. The next prime is 5140534333097. The reversal of 5140534333050 is 503334350415.
5140534333050 is a `hidden beast` number, since 5 + 1 + 4 + 0 + 5 + 343 + 3 + 305 + 0 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5140534332996 and 5140534333014.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2939844 + ... + 4350143.
It is an arithmetic number, because the mean of its divisors is an integer number (191940524048).
Almost surely, 25140534333050 is an apocalyptic number.
5140534333050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5140534333050 is an abundant number, since it is smaller than the sum of its proper divisors (8679183398406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5140534333050 is a wasteful number, since it uses less digits than its factorization.
5140534333050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7291572 (or 7291564 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 36.
Adding to 5140534333050 its reverse (503334350415), we get a palindrome (5643868683465).
The spelling of 5140534333050 in words is "five trillion, one hundred forty billion, five hundred thirty-four million, three hundred thirty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •