Base | Representation |
---|---|
bin | 100101100010101111010111… |
… | …1110011100000001000010101 |
3 | 1121022020200121110101112012122 |
4 | 1023011132233303200020111 |
5 | 321240442221100020201 |
6 | 3130201340313025325 |
7 | 126362223504001163 |
oct | 11305365763401025 |
9 | 1538220543345178 |
10 | 330230100001301 |
11 | 96248887408205 |
12 | 310549803b5245 |
13 | 11235745b6c596 |
14 | 5b79317700233 |
15 | 282a09938ae1b |
hex | 12c57afce0215 |
330230100001301 has 16 divisors (see below), whose sum is σ = 339280090423296. Its totient is φ = 321186702525696.
The previous prime is 330230100001273. The next prime is 330230100001303. The reversal of 330230100001301 is 103100001032033.
It is a cyclic number.
It is not a de Polignac number, because 330230100001301 - 218 = 330230099739157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 330230100001301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330230100001303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1134638540 + ... + 1134929546.
It is an arithmetic number, because the mean of its divisors is an integer number (21205005651456).
Almost surely, 2330230100001301 is an apocalyptic number.
It is an amenable number.
330230100001301 is a deficient number, since it is larger than the sum of its proper divisors (9049990421995).
330230100001301 is a wasteful number, since it uses less digits than its factorization.
330230100001301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302228.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 330230100001301 its reverse (103100001032033), we get a palindrome (433330101033334).
The spelling of 330230100001301 in words is "three hundred thirty trillion, two hundred thirty billion, one hundred million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •