Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0001110010010010011111 |
3 | 1201002211020212022122122121 |
4 | 2331133002001302102133 |
5 | 3201320111041402312 |
6 | 43405523025323411 |
7 | 2512520660221450 |
oct | 275370201622237 |
9 | 51084225278577 |
10 | 13021301122207 |
11 | 4170337023124 |
12 | 1563747496567 |
13 | 735b98aa1a41 |
14 | 33033d041127 |
15 | 178aa9765707 |
hex | bd7c207249f |
13021301122207 has 8 divisors (see below), whose sum is σ = 14887087878816. Its totient is φ = 11156914586112.
The previous prime is 13021301122201. The next prime is 13021301122211. The reversal of 13021301122207 is 70222110312031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13021301122207 - 23 = 13021301122199 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021301122201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350035198 + ... + 350072395.
It is an arithmetic number, because the mean of its divisors is an integer number (1860885984852).
Almost surely, 213021301122207 is an apocalyptic number.
13021301122207 is a deficient number, since it is larger than the sum of its proper divisors (1865786756609).
13021301122207 is an equidigital number, since it uses as much as digits as its factorization.
13021301122207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700110257.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 13021301122207 its reverse (70222110312031), we get a palindrome (83243411434238).
The spelling of 13021301122207 in words is "thirteen trillion, twenty-one billion, three hundred one million, one hundred twenty-two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •