Base | Representation |
---|---|
bin | 100100100100011100111… |
… | …000111000000111000101 |
3 | 22220020121010010122020022 |
4 | 210210130320320013011 |
5 | 312133201334240401 |
6 | 5202250324144525 |
7 | 346363326066650 |
oct | 44443470700705 |
9 | 8806533118208 |
10 | 2513040540101 |
11 | 889857963053 |
12 | 347064238145 |
13 | 152c952a9460 |
14 | 898bb992897 |
15 | 455838be71b |
hex | 2491ce381c5 |
2513040540101 has 8 divisors (see below), whose sum is σ = 3092972972544. Its totient is φ = 1988339767920.
The previous prime is 2513040540097. The next prime is 2513040540251. The reversal of 2513040540101 is 1010450403152.
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 2513040540101 - 22 = 2513040540097 is a prime.
It is a super-3 number, since 3×25130405401013 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2513040540401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13807914965 + ... + 13807915146.
It is an arithmetic number, because the mean of its divisors is an integer number (386621621568).
Almost surely, 22513040540101 is an apocalyptic number.
It is an amenable number.
2513040540101 is a deficient number, since it is larger than the sum of its proper divisors (579932432443).
2513040540101 is a wasteful number, since it uses less digits than its factorization.
2513040540101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27615830131.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 2513040540101 its reverse (1010450403152), we get a palindrome (3523490943253).
The spelling of 2513040540101 in words is "two trillion, five hundred thirteen billion, forty million, five hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •