Base | Representation |
---|---|
bin | 1100000110110000011111… |
… | …0001110101010100001101 |
3 | 1202010110001002210110101201 |
4 | 3001230013301311110031 |
5 | 3221033324420414003 |
6 | 44150345343105501 |
7 | 2542430003403331 |
oct | 301540761652415 |
9 | 52113032713351 |
10 | 13310234154253 |
11 | 4271925201613 |
12 | 15ab7425a2291 |
13 | 7571c3b595aa |
14 | 34030c43d7c1 |
15 | 18136a557b1d |
hex | c1b07c7550d |
13310234154253 has 16 divisors (see below), whose sum is σ = 13441399787520. Its totient is φ = 13179307889664.
The previous prime is 13310234154241. The next prime is 13310234154311. The reversal of 13310234154253 is 35245143201331.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13310234154253 is a prime.
It is a super-3 number, since 3×133102341542533 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310234754253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1098832725 + ... + 1098844837.
It is an arithmetic number, because the mean of its divisors is an integer number (840087486720).
Almost surely, 213310234154253 is an apocalyptic number.
It is an amenable number.
13310234154253 is a deficient number, since it is larger than the sum of its proper divisors (131165633267).
13310234154253 is a wasteful number, since it uses less digits than its factorization.
13310234154253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21108.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 13310234154253 its reverse (35245143201331), we get a palindrome (48555377355584).
The spelling of 13310234154253 in words is "thirteen trillion, three hundred ten billion, two hundred thirty-four million, one hundred fifty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •