Base | Representation |
---|---|
bin | 10010111101101101111… |
… | …101110110111101010001 |
3 | 11121120211122101120112202 |
4 | 102331231331312331101 |
5 | 132322443311214441 |
6 | 2434405131532545 |
7 | 163104002265032 |
oct | 22755575667521 |
9 | 4546748346482 |
10 | 1303220023121 |
11 | 462768801225 |
12 | 1906a58ba155 |
13 | 95b7c256a73 |
14 | 4710d0a6a89 |
15 | 23d7697b19b |
hex | 12f6df76f51 |
1303220023121 has 4 divisors (see below), whose sum is σ = 1303333171200. Its totient is φ = 1303106875044.
The previous prime is 1303220023099. The next prime is 1303220023163. The reversal of 1303220023121 is 1213200223031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1303220023121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1303220023093 and 1303220023102.
It is not an unprimeable number, because it can be changed into a prime (1303220023421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56556761 + ... + 56579798.
It is an arithmetic number, because the mean of its divisors is an integer number (325833292800).
Almost surely, 21303220023121 is an apocalyptic number.
It is an amenable number.
1303220023121 is a deficient number, since it is larger than the sum of its proper divisors (113148079).
1303220023121 is a wasteful number, since it uses less digits than its factorization.
1303220023121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113148078.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1303220023121 its reverse (1213200223031), we get a palindrome (2516420246152).
The spelling of 1303220023121 in words is "one trillion, three hundred three billion, two hundred twenty million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •