Base | Representation |
---|---|
bin | 1011110110000011100111… |
… | …0010010100000110011001 |
3 | 1201010000102220000002202201 |
4 | 2331200321302110012121 |
5 | 3201333214421113223 |
6 | 43410454241530201 |
7 | 2512621525223041 |
oct | 275407162240631 |
9 | 51100386002681 |
10 | 13023310332313 |
11 | 4171178190446 |
12 | 1564008343961 |
13 | 736129122268 |
14 | 33048dc16721 |
15 | 178b75d46ead |
hex | bd839c94199 |
13023310332313 has 8 divisors (see below), whose sum is σ = 13079370710016. Its totient is φ = 12967251376800.
The previous prime is 13023310332301. The next prime is 13023310332359. The reversal of 13023310332313 is 31323301332031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13023310332313 - 237 = 12885871378841 is a prime.
It is a super-2 number, since 2×130233103323132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13023310332413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20666808 + ... + 21287638.
It is an arithmetic number, because the mean of its divisors is an integer number (1634921338752).
Almost surely, 213023310332313 is an apocalyptic number.
It is an amenable number.
13023310332313 is a deficient number, since it is larger than the sum of its proper divisors (56060377703).
13023310332313 is an equidigital number, since it uses as much as digits as its factorization.
13023310332313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711095.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 13023310332313 its reverse (31323301332031), we get a palindrome (44346611664344).
The spelling of 13023310332313 in words is "thirteen trillion, twenty-three billion, three hundred ten million, three hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •