Base | Representation |
---|---|
bin | 10010111101100010101… |
… | …001011100100111111001 |
3 | 11121120100102001122112222 |
4 | 102331202221130213321 |
5 | 132322101202414001 |
6 | 2434334225413425 |
7 | 163066205204255 |
oct | 22754251344771 |
9 | 4546312048488 |
10 | 1303030123001 |
11 | 462680597482 |
12 | 19065219a275 |
13 | 95b4bac7929 |
14 | 470d1b93265 |
15 | 23d64e6961b |
hex | 12f62a5c9f9 |
1303030123001 has 4 divisors (see below), whose sum is σ = 1303273822032. Its totient is φ = 1302786423972.
The previous prime is 1303030122967. The next prime is 1303030123063. The reversal of 1303030123001 is 1003210303031.
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 not a de Polignac number, because 1303030123001 - 210 = 1303030121977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1303030123301) 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 3 ways as a sum of consecutive naturals, for example, 121841495 + ... + 121852188.
It is an arithmetic number, because the mean of its divisors is an integer number (325818455508).
Almost surely, 21303030123001 is an apocalyptic number.
It is an amenable number.
1303030123001 is a deficient number, since it is larger than the sum of its proper divisors (243699031).
1303030123001 is an equidigital number, since it uses as much as digits as its factorization.
1303030123001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243699030.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1303030123001 its reverse (1003210303031), we get a palindrome (2306240426032).
The spelling of 1303030123001 in words is "one trillion, three hundred three billion, thirty million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •