Base | Representation |
---|---|
bin | 101000010011110010001… |
… | …0000010000111001010101 |
3 | 201121121211002000010002111 |
4 | 1100213210100100321111 |
5 | 1211232001313011201 |
6 | 15441021005311021 |
7 | 1111153261453636 |
oct | 120474420207125 |
9 | 21547732003074 |
10 | 5540042313301 |
11 | 1846578503671 |
12 | 755844b65471 |
13 | 312567c8b042 |
14 | 1521d4a2d88d |
15 | 991988e8b51 |
hex | 509e4410e55 |
5540042313301 has 8 divisors (see below), whose sum is σ = 5555597112000. Its totient is φ = 5524488198240.
The previous prime is 5540042313287. The next prime is 5540042313343. The reversal of 5540042313301 is 1033132400455.
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 5540042313301 - 215 = 5540042280533 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 (5540042313901) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 19102425 + ... + 19390273.
It is an arithmetic number, because the mean of its divisors is an integer number (694449639000).
Almost surely, 25540042313301 is an apocalyptic number.
It is an amenable number.
5540042313301 is a deficient number, since it is larger than the sum of its proper divisors (15554798699).
5540042313301 is a wasteful number, since it uses less digits than its factorization.
5540042313301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341819.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 5540042313301 its reverse (1033132400455), we get a palindrome (6573174713756).
The spelling of 5540042313301 in words is "five trillion, five hundred forty billion, forty-two million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •