Base | Representation |
---|---|
bin | 100100101011000110001… |
… | …0001101111111101010101 |
3 | 122211212000122221122122201 |
4 | 1021112030101233331111 |
5 | 1130040114111220313 |
6 | 14415301015124501 |
7 | 1030103400651421 |
oct | 111261421577525 |
9 | 18755018848581 |
10 | 5040350101333 |
11 | 1673667259948 |
12 | 694a2b073731 |
13 | 2a73c2836b81 |
14 | 135d50649b81 |
15 | 8b19ed120dd |
hex | 4958c46ff55 |
5040350101333 has 8 divisors (see below), whose sum is σ = 5043812954400. Its totient is φ = 5036887594128.
The previous prime is 5040350101313. The next prime is 5040350101387. The reversal of 5040350101333 is 3331010530405.
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 5040350101333 - 225 = 5040316546901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5040350101313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33508710 + ... + 33658792.
It is an arithmetic number, because the mean of its divisors is an integer number (630476619300).
Almost surely, 25040350101333 is an apocalyptic number.
It is an amenable number.
5040350101333 is a deficient number, since it is larger than the sum of its proper divisors (3462853067).
5040350101333 is a wasteful number, since it uses less digits than its factorization.
5040350101333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172931.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 5040350101333 its reverse (3331010530405), we get a palindrome (8371360631738).
The spelling of 5040350101333 in words is "five trillion, forty billion, three hundred fifty million, one hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •