Base | Representation |
---|---|
bin | 10001111001100010011… |
… | …000110010000011111011 |
3 | 11100120212121021122012201 |
4 | 101321202120302003323 |
5 | 130123030343412311 |
6 | 2341020455051031 |
7 | 154602553426426 |
oct | 21714230620373 |
9 | 4316777248181 |
10 | 1230011310331 |
11 | 434710355801 |
12 | 17a474370a77 |
13 | 8bcb310cbbb |
14 | 437662789bd |
15 | 21ede7ea9c1 |
hex | 11e626320fb |
1230011310331 has 4 divisors (see below), whose sum is σ = 1230027698664. Its totient is φ = 1229994922000.
The previous prime is 1230011310323. The next prime is 1230011310379. The reversal of 1230011310331 is 1330131100321.
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 1230011310331 - 23 = 1230011310323 is a prime.
It is a super-2 number, since 2×12300113103312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1230011310299 and 1230011310308.
It is not an unprimeable number, because it can be changed into a prime (1230011310431) 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, 8081065 + ... + 8231866.
It is an arithmetic number, because the mean of its divisors is an integer number (307506924666).
Almost surely, 21230011310331 is an apocalyptic number.
1230011310331 is a deficient number, since it is larger than the sum of its proper divisors (16388333).
1230011310331 is an equidigital number, since it uses as much as digits as its factorization.
1230011310331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16388332.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1230011310331 its reverse (1330131100321), we get a palindrome (2560142410652).
The spelling of 1230011310331 in words is "one trillion, two hundred thirty billion, eleven million, three hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •