Search a number
-
+
13010100333 = 313133104581
BaseRepresentation
bin11000001110111011…
…00110000001101101
31020120200210120111220
430013131212001231
5203121041202313
65550551333553
7640255012446
oct140735460155
936520716456
1013010100333
115576953a3a
1226310812b9
1312c44ca129
148b5c382cd
15512299823
hex30776606d

13010100333 has 8 divisors (see below), whose sum is σ = 17479219296. Its totient is φ = 8607190800.

The previous prime is 13010100331. The next prime is 13010100377. The reversal of 13010100333 is 33300101031.

13010100333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13010100333 - 21 = 13010100331 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13010100331) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16551898 + ... + 16552683.

It is an arithmetic number, because the mean of its divisors is an integer number (2184902412).

Almost surely, 213010100333 is an apocalyptic number.

It is an amenable number.

13010100333 is a deficient number, since it is larger than the sum of its proper divisors (4469118963).

13010100333 is a wasteful number, since it uses less digits than its factorization.

13010100333 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 33104715.

The product of its (nonzero) digits is 81, while the sum is 15.

Adding to 13010100333 its reverse (33300101031), we get a palindrome (46310201364).

The spelling of 13010100333 in words is "thirteen billion, ten million, one hundred thousand, three hundred thirty-three".

Divisors: 1 3 131 393 33104581 99313743 4336700111 13010100333