Base | Representation |
---|---|
bin | 1011001100000000110011… |
… | …0011010011001100111011 |
3 | 1121112222000220202210201222 |
4 | 2303000030303103030323 |
5 | 3103014422241012311 |
6 | 42055000224302255 |
7 | 2406501163152023 |
oct | 263001463231473 |
9 | 47488026683658 |
10 | 12301001110331 |
11 | 3a1290949310a |
12 | 146802447198b |
13 | 6b2c96a56b6b |
14 | 30752ba7aa83 |
15 | 164e9d42eadb |
hex | b300ccd333b |
12301001110331 has 4 divisors (see below), whose sum is σ = 12302270704200. Its totient is φ = 12299731516464.
The previous prime is 12301001110297. The next prime is 12301001110367. The reversal of 12301001110331 is 13301110010321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12301001110331 - 238 = 12026123203387 is a prime.
It is a super-3 number, since 3×123010011103313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12301001110231) 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, 634782401 + ... + 634801778.
It is an arithmetic number, because the mean of its divisors is an integer number (3075567676050).
Almost surely, 212301001110331 is an apocalyptic number.
12301001110331 is a deficient number, since it is larger than the sum of its proper divisors (1269593869).
12301001110331 is an equidigital number, since it uses as much as digits as its factorization.
12301001110331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1269593868.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 12301001110331 its reverse (13301110010321), we get a palindrome (25602111120652).
The spelling of 12301001110331 in words is "twelve trillion, three hundred one billion, one million, one hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •