Base | Representation |
---|---|
bin | 11101011111000101100… |
… | …10100001101000010001 |
3 | 10120212001020011202222201 |
4 | 32233202302201220101 |
5 | 113044333241212241 |
6 | 2053231045003201 |
7 | 133124053461664 |
oct | 16574262415021 |
9 | 3525036152881 |
10 | 1013122210321 |
11 | 360732091811 |
12 | 1444246b3501 |
13 | 746c9a89530 |
14 | 3706d1056db |
15 | 1b5487a8931 |
hex | ebe2ca1a11 |
1013122210321 has 8 divisors (see below), whose sum is σ = 1091133336384. Its totient is φ = 935122319760.
The previous prime is 1013122210297. The next prime is 1013122210327. The reversal of 1013122210321 is 1230122213101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013122210321 is a prime.
It is a super-2 number, since 2×10131222103212 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1013122210327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2621125 + ... + 2982706.
It is an arithmetic number, because the mean of its divisors is an integer number (136391667048).
Almost surely, 21013122210321 is an apocalyptic number.
It is an amenable number.
1013122210321 is a deficient number, since it is larger than the sum of its proper divisors (78011126063).
1013122210321 is a wasteful number, since it uses less digits than its factorization.
1013122210321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5617751.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1013122210321 its reverse (1230122213101), we get a palindrome (2243244423422).
The spelling of 1013122210321 in words is "one trillion, thirteen billion, one hundred twenty-two million, two hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •