Base | Representation |
---|---|
bin | 11000110011000010… |
… | …11100100111001001 |
3 | 1021100210221120020102 |
4 | 30121201130213021 |
5 | 204231123201413 |
6 | 10041013535145 |
7 | 650624325206 |
oct | 143141344711 |
9 | 37323846212 |
10 | 13313100233 |
11 | 5711997284 |
12 | 26b66444b5 |
13 | 1342208504 |
14 | 90418ccad |
15 | 52db9c458 |
hex | 31985c9c9 |
13313100233 has 4 divisors (see below), whose sum is σ = 13380679620. Its totient is φ = 13245520848.
The previous prime is 13313100217. The next prime is 13313100259. The reversal of 13313100233 is 33200131331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33200131331 = 47 ⋅706385773.
It can be written as a sum of positive squares in 2 ways, for example, as 12349432384 + 963667849 = 111128^2 + 31043^2 .
It is a cyclic number.
It is not a de Polignac number, because 13313100233 - 24 = 13313100217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13313100433) 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, 33789398 + ... + 33789791.
It is an arithmetic number, because the mean of its divisors is an integer number (3345169905).
Almost surely, 213313100233 is an apocalyptic number.
It is an amenable number.
13313100233 is a deficient number, since it is larger than the sum of its proper divisors (67579387).
13313100233 is an equidigital number, since it uses as much as digits as its factorization.
13313100233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67579386.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 13313100233 its reverse (33200131331), we get a palindrome (46513231564).
The spelling of 13313100233 in words is "thirteen billion, three hundred thirteen million, one hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •