Base | Representation |
---|---|
bin | 100100101011100011001… |
… | …0010011001100000011000 |
3 | 122211221112111021210220010 |
4 | 1021113012102121200120 |
5 | 1130044112234200130 |
6 | 14415541343201520 |
7 | 1030136456304255 |
oct | 111270622314030 |
9 | 18757474253803 |
10 | 5041323350040 |
11 | 167401667101a |
12 | 695060ba62a0 |
13 | 2a7519368993 |
14 | 1360039d242c |
15 | 8b20a4ac0b0 |
hex | 495c6499818 |
5041323350040 has 64 divisors (see below), whose sum is σ = 15146920166400. Its totient is φ = 1342312883072.
The previous prime is 5041323350033. The next prime is 5041323350083. The reversal of 5041323350040 is 400533231405.
It is a super-2 number, since 2×50413233500402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31795752 + ... + 31953911.
It is an arithmetic number, because the mean of its divisors is an integer number (236670627600).
Almost surely, 25041323350040 is an apocalyptic number.
It is an amenable number.
5041323350040 is an abundant number, since it is smaller than the sum of its proper divisors (10105596816360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5041323350040 is a wasteful number, since it uses less digits than its factorization.
5041323350040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63750336 (or 63750332 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 5041323350040 its reverse (400533231405), we get a palindrome (5441856581445).
The spelling of 5041323350040 in words is "five trillion, forty-one billion, three hundred twenty-three million, three hundred fifty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •