Base | Representation |
---|---|
bin | 11000110011001010… |
… | …11011000001111010 |
3 | 1021100212220111201121 |
4 | 30121211123001322 |
5 | 204231410023310 |
6 | 10041052135454 |
7 | 650636225326 |
oct | 143145330172 |
9 | 37325814647 |
10 | 13314142330 |
11 | 5712539215 |
12 | 26b6a6758a |
13 | 13424b1938 |
14 | 904380986 |
15 | 52dd060da |
hex | 31995b07a |
13314142330 has 16 divisors (see below), whose sum is σ = 23970161160. Its totient is φ = 5324611392.
The previous prime is 13314142321. The next prime is 13314142351. The reversal of 13314142330 is 3324141331.
13314142330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 8464552009 + 4849590321 = 92003^2 + 69639^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13314142295 and 13314142304.
It is an unprimeable number.
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, 76125 + ... + 180064.
Almost surely, 213314142330 is an apocalyptic number.
13314142330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13314142330 is a deficient number, since it is larger than the sum of its proper divisors (10656018830).
13314142330 is a wasteful number, since it uses less digits than its factorization.
13314142330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261393.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13314142330 its reverse (3324141331), we get a palindrome (16638283661).
Subtracting from 13314142330 its reverse (3324141331), we obtain a palindrome (9990000999).
The spelling of 13314142330 in words is "thirteen billion, three hundred fourteen million, one hundred forty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •