Base | Representation |
---|---|
bin | 1011110111000110011010… |
… | …0000010000100101011110 |
3 | 1201011201201110200002222211 |
4 | 2331301212200100211132 |
5 | 3202131430023140410 |
6 | 43423021350231034 |
7 | 2514125044522636 |
oct | 275614640204536 |
9 | 51151643602884 |
10 | 13041240443230 |
11 | 417883927812a |
12 | 156759105547a |
13 | 737a25a2264c |
14 | 3312b124d6c6 |
15 | 179374ee768a |
hex | bdc6681095e |
13041240443230 has 8 divisors (see below), whose sum is σ = 23474232797832. Its totient is φ = 5216496177288.
The previous prime is 13041240443171. The next prime is 13041240443261. The reversal of 13041240443230 is 3234404214031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×130412404432303 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13041240443192 and 13041240443201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 652062022152 + ... + 652062022171.
It is an arithmetic number, because the mean of its divisors is an integer number (2934279099729).
Almost surely, 213041240443230 is an apocalyptic number.
13041240443230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13041240443230 is a deficient number, since it is larger than the sum of its proper divisors (10432992354602).
13041240443230 is a wasteful number, since it uses less digits than its factorization.
13041240443230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1304124044330.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 13041240443230 its reverse (3234404214031), we get a palindrome (16275644657261).
The spelling of 13041240443230 in words is "thirteen trillion, forty-one billion, two hundred forty million, four hundred forty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •