Base | Representation |
---|---|
bin | 10010111011111011100… |
… | …010101100110110110001 |
3 | 11121101212212002121012002 |
4 | 102323323202230312301 |
5 | 132310030334114413 |
6 | 2433450433343345 |
7 | 163005302025152 |
oct | 22737342546661 |
9 | 4541785077162 |
10 | 1301300301233 |
11 | 461973105809 |
12 | 19024aa07b55 |
13 | 9593460955a |
14 | 46daa147929 |
15 | 23cb3174958 |
hex | 12efb8acdb1 |
1301300301233 has 4 divisors (see below), whose sum is σ = 1303587297060. Its totient is φ = 1299013305408.
The previous prime is 1301300301209. The next prime is 1301300301311. The reversal of 1301300301233 is 3321030031031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 769818476449 + 531481824784 = 877393^2 + 729028^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301300301233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1301300601233) 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, 1143497060 + ... + 1143498197.
It is an arithmetic number, because the mean of its divisors is an integer number (325896824265).
Almost surely, 21301300301233 is an apocalyptic number.
It is an amenable number.
1301300301233 is a deficient number, since it is larger than the sum of its proper divisors (2286995827).
1301300301233 is an equidigital number, since it uses as much as digits as its factorization.
1301300301233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2286995826.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1301300301233 its reverse (3321030031031), we get a palindrome (4622330332264).
The spelling of 1301300301233 in words is "one trillion, three hundred one billion, three hundred million, three hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •