Base | Representation |
---|---|
bin | 1011110111010101010101… |
… | …0010100010101110011100 |
3 | 1201012010001122222001212202 |
4 | 2331311111102202232130 |
5 | 3202213131112232030 |
6 | 43424523100151032 |
7 | 2514326241360344 |
oct | 275652522425634 |
9 | 51163048861782 |
10 | 13045246602140 |
11 | 417a504688665 |
12 | 156830a838478 |
13 | 7382139bc48c |
14 | 331571327d24 |
15 | 17950ba87745 |
hex | bdd554a2b9c |
13045246602140 has 12 divisors (see below), whose sum is σ = 27395017864536. Its totient is φ = 5218098640848.
The previous prime is 13045246602139. The next prime is 13045246602149. The reversal of 13045246602140 is 4120664254031.
It is a junction number, because it is equal to n+sod(n) for n = 13045246602094 and 13045246602103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13045246602149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326131165034 + ... + 326131165073.
It is an arithmetic number, because the mean of its divisors is an integer number (2282918155378).
Almost surely, 213045246602140 is an apocalyptic number.
13045246602140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13045246602140 is an abundant number, since it is smaller than the sum of its proper divisors (14349771262396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13045246602140 is a wasteful number, since it uses less digits than its factorization.
13045246602140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652262330116 (or 652262330114 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 13045246602140 in words is "thirteen trillion, forty-five billion, two hundred forty-six million, six hundred two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •