Base | Representation |
---|---|
bin | 110001110010… |
… | …000101110111 |
3 | 220120000112220 |
4 | 301302011313 |
5 | 11320101411 |
6 | 1143413423 |
7 | 215632215 |
oct | 61620567 |
9 | 26500486 |
10 | 13050231 |
11 | 7403917 |
12 | 4454273 |
13 | 291c03c |
14 | 1a39cb5 |
15 | 122bb06 |
hex | c72177 |
13050231 has 4 divisors (see below), whose sum is σ = 17400312. Its totient is φ = 8700152.
The previous prime is 13050229. The next prime is 13050241. The reversal of 13050231 is 13205031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13050231 - 21 = 13050229 is a prime.
It is a super-2 number, since 2×130502312 = 340617058306722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13050231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13050211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2175036 + ... + 2175041.
It is an arithmetic number, because the mean of its divisors is an integer number (4350078).
Almost surely, 213050231 is an apocalyptic number.
13050231 is a deficient number, since it is larger than the sum of its proper divisors (4350081).
13050231 is an equidigital number, since it uses as much as digits as its factorization.
13050231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4350080.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 13050231 is about 3612.5103460059. The cubic root of 13050231 is about 235.4359254282.
Adding to 13050231 its reverse (13205031), we get a palindrome (26255262).
The spelling of 13050231 in words is "thirteen million, fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •