Base | Representation |
---|---|
bin | 11000011111100110… |
… | …11001100010000011 |
3 | 1020221110002221111012 |
4 | 30033303121202003 |
5 | 203412402042201 |
6 | 10012510511135 |
7 | 643604305460 |
oct | 141763314203 |
9 | 36843087435 |
10 | 13150034051 |
11 | 5638940240 |
12 | 266bb054ab |
13 | 13174b324b |
14 | 8ca662667 |
15 | 51e6db5bb |
hex | 30fcd9883 |
13150034051 has 16 divisors (see below), whose sum is σ = 16416131328. Its totient is φ = 10233477600.
The previous prime is 13150034041. The next prime is 13150034063. The reversal of 13150034051 is 15043005131.
13150034051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13150034051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13150034011) 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 15 ways as a sum of consecutive naturals, for example, 50945 + ... + 169986.
It is an arithmetic number, because the mean of its divisors is an integer number (1026008208).
Almost surely, 213150034051 is an apocalyptic number.
13150034051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13150034051 is a deficient number, since it is larger than the sum of its proper divisors (3266097277).
13150034051 is a wasteful number, since it uses less digits than its factorization.
13150034051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221722.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 13150034051 its reverse (15043005131), we get a palindrome (28193039182).
The spelling of 13150034051 in words is "thirteen billion, one hundred fifty million, thirty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •