Base | Representation |
---|---|
bin | 100101100011011001110000… |
… | …0000000110100011110110001 |
3 | 1121022120101111121210112200021 |
4 | 1023012303200000310132301 |
5 | 321243440104344041423 |
6 | 3130311230405323441 |
7 | 126401624603453101 |
oct | 11306634000643661 |
9 | 1538511447715607 |
10 | 330321103112113 |
11 | 962834362872a3 |
12 | 3106a539106581 |
13 | 112411b974a949 |
14 | 5b7d8ab919201 |
15 | 282c62381095d |
hex | 12c6ce00347b1 |
330321103112113 has 16 divisors (see below), whose sum is σ = 362825565926400. Its totient is φ = 299328664781520.
The previous prime is 330321103112101. The next prime is 330321103112129. The reversal of 330321103112113 is 311211301123033.
It is a cyclic number.
It is not a de Polignac number, because 330321103112113 - 213 = 330321103103921 is a prime.
It is a super-2 number, since 2×3303211031121132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330321103112183) 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, 116828548 + ... + 119622538.
It is an arithmetic number, because the mean of its divisors is an integer number (22676597870400).
Almost surely, 2330321103112113 is an apocalyptic number.
It is an amenable number.
330321103112113 is a deficient number, since it is larger than the sum of its proper divisors (32504462814287).
330321103112113 is a wasteful number, since it uses less digits than its factorization.
330321103112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3064572.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 330321103112113 its reverse (311211301123033), we get a palindrome (641532404235146).
The spelling of 330321103112113 in words is "three hundred thirty trillion, three hundred twenty-one billion, one hundred three million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •