Base | Representation |
---|---|
bin | 1011110110101100101101… |
… | …0101101101001110111111 |
3 | 1201011001220201111010210022 |
4 | 2331223023111231032333 |
5 | 3202023313103204330 |
6 | 43415521050002355 |
7 | 2513462103004541 |
oct | 275531325551677 |
9 | 51131821433708 |
10 | 13034342241215 |
11 | 4175919432929 |
12 | 1566186a163bb |
13 | 73719683c6c9 |
14 | 330c19031691 |
15 | 1790be5daae5 |
hex | bdacb56d3bf |
13034342241215 has 8 divisors (see below), whose sum is σ = 15641230219488. Its totient is φ = 10427460772960.
The previous prime is 13034342241203. The next prime is 13034342241269. The reversal of 13034342241215 is 51214224343031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13034342241215 - 210 = 13034342240191 is a prime.
It is a super-2 number, since 2×130343422412152 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6198014 + ... + 8030196.
It is an arithmetic number, because the mean of its divisors is an integer number (1955153777436).
Almost surely, 213034342241215 is an apocalyptic number.
13034342241215 is a deficient number, since it is larger than the sum of its proper divisors (2606887978273).
13034342241215 is a wasteful number, since it uses less digits than its factorization.
13034342241215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3255009.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 13034342241215 its reverse (51214224343031), we get a palindrome (64248566584246).
The spelling of 13034342241215 in words is "thirteen trillion, thirty-four billion, three hundred forty-two million, two hundred forty-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •