Base | Representation |
---|---|
bin | 1011110101111100001010… |
… | …1011101010101100001101 |
3 | 1201002211021121222102220111 |
4 | 2331133002223222230031 |
5 | 3201320121344214013 |
6 | 43405524100520021 |
7 | 2512521152436130 |
oct | 275370253525415 |
9 | 51084247872814 |
10 | 13021312101133 |
11 | 4170342241816 |
12 | 156374b0b0011 |
13 | 735b9b14704b |
14 | 33034069c217 |
15 | 178aaa6d373d |
hex | bd7c2aeab0d |
13021312101133 has 8 divisors (see below), whose sum is σ = 15361547916800. Its totient is φ = 10801088378640.
The previous prime is 13021312101101. The next prime is 13021312101173. The reversal of 13021312101133 is 33110121312031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13021312101133 - 25 = 13021312101101 is a prime.
It is a super-2 number, since 2×130213121011332 (a number of 27 digits) contains 22 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 (13021312101173) 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, 30003023058 + ... + 30003023491.
It is an arithmetic number, because the mean of its divisors is an integer number (1920193489600).
Almost surely, 213021312101133 is an apocalyptic number.
It is an amenable number.
13021312101133 is a deficient number, since it is larger than the sum of its proper divisors (2340235815667).
13021312101133 is an equidigital number, since it uses as much as digits as its factorization.
13021312101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60006046587.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13021312101133 its reverse (33110121312031), we get a palindrome (46131433413164).
The spelling of 13021312101133 in words is "thirteen trillion, twenty-one billion, three hundred twelve million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •