Base | Representation |
---|---|
bin | 11000011100000010… |
… | …01101101111010011 |
3 | 1020212100210012111221 |
4 | 30032001031233103 |
5 | 203332221220311 |
6 | 10005521145511 |
7 | 643062010201 |
oct | 141601155723 |
9 | 36770705457 |
10 | 13120101331 |
11 | 5622a56357 |
12 | 2661a8b297 |
13 | 1311232a8c |
14 | 8c66b0071 |
15 | 51bc77671 |
hex | 30e04dbd3 |
13120101331 has 24 divisors (see below), whose sum is σ = 14009302944. Its totient is φ = 12284749440.
The previous prime is 13120101317. The next prime is 13120101343. The reversal of 13120101331 is 13310102131.
13120101331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13120101331 - 25 = 13120101299 is a prime.
It is a super-2 number, since 2×131201013312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13120101131) 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 23 ways as a sum of consecutive naturals, for example, 15380701 + ... + 15381553.
It is an arithmetic number, because the mean of its divisors is an integer number (583720956).
Almost surely, 213120101331 is an apocalyptic number.
13120101331 is a deficient number, since it is larger than the sum of its proper divisors (889201613).
13120101331 is a wasteful number, since it uses less digits than its factorization.
13120101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339 (or 1320 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13120101331 its reverse (13310102131), we get a palindrome (26430203462).
The spelling of 13120101331 in words is "thirteen billion, one hundred twenty million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •