Base | Representation |
---|---|
bin | 1011110101111100001101… |
… | …0101101111100110100101 |
3 | 1201002211022101201211110020 |
4 | 2331133003111233212211 |
5 | 3201320132210200201 |
6 | 43405525133145353 |
7 | 2512521345256062 |
oct | 275370325574645 |
9 | 51084271654406 |
10 | 13021323131301 |
11 | 4170348495961 |
12 | 156375292b259 |
13 | 735ba0509784 |
14 | 330341d2dc69 |
15 | 178aab661a36 |
hex | bd7c356f9a5 |
13021323131301 has 8 divisors (see below), whose sum is σ = 17362351216224. Its totient is φ = 8680588566960.
The previous prime is 13021323131263. The next prime is 13021323131339. The reversal of 13021323131301 is 10313132312031.
It is an interprime number because it is at equal distance from previous prime (13021323131263) and next prime (13021323131339).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13021323131301 - 211 = 13021323129253 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021323138301) 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, 73276611 + ... + 73454096.
It is an arithmetic number, because the mean of its divisors is an integer number (2170293902028).
Almost surely, 213021323131301 is an apocalyptic number.
It is an amenable number.
13021323131301 is a deficient number, since it is larger than the sum of its proper divisors (4341028084923).
13021323131301 is a wasteful number, since it uses less digits than its factorization.
13021323131301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146760291.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13021323131301 its reverse (10313132312031), we get a palindrome (23334455443332).
The spelling of 13021323131301 in words is "thirteen trillion, twenty-one billion, three hundred twenty-three million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •