Base | Representation |
---|---|
bin | 1100000110110000011100… |
… | …1000011011111001011001 |
3 | 1202010110000100101010020001 |
4 | 3001230013020123321121 |
5 | 3221033314131132413 |
6 | 44150344314333001 |
7 | 2542426512224644 |
oct | 301540710337131 |
9 | 52113010333201 |
10 | 13310223302233 |
11 | 427191a06a300 |
12 | 15ab73aa2a161 |
13 | 7571c1829c90 |
14 | 34030ac16a5b |
15 | 1813696124dd |
hex | c1b0721be59 |
13310223302233 has 24 divisors (see below), whose sum is σ = 15763195032200. Its totient is φ = 11164068622080.
The previous prime is 13310223302227. The next prime is 13310223302261. The reversal of 13310223302233 is 33220332201331.
It can be written as a sum of positive squares in 4 ways, for example, as 866487307609 + 12443735994624 = 930853^2 + 3527568^2 .
It is not a de Polignac number, because 13310223302233 - 237 = 13172784348761 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13310223302263) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1260703 + ... + 5311291.
Almost surely, 213310223302233 is an apocalyptic number.
13310223302233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13310223302233 is a deficient number, since it is larger than the sum of its proper divisors (2452971729967).
13310223302233 is a wasteful number, since it uses less digits than its factorization.
13310223302233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4052713 (or 4052702 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13310223302233 its reverse (33220332201331), we get a palindrome (46530555503564).
The spelling of 13310223302233 in words is "thirteen trillion, three hundred ten billion, two hundred twenty-three million, three hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •