Base | Representation |
---|---|
bin | 11001011100110000… |
… | …11010010111001010 |
3 | 1022021012110000112120 |
4 | 30232120122113022 |
5 | 210440220201013 |
6 | 10135434352110 |
7 | 662404015341 |
oct | 145630322712 |
9 | 38235400476 |
10 | 13663053258 |
11 | 588148a158 |
12 | 279388b636 |
13 | 13998761ca |
14 | 938846b58 |
15 | 54e777123 |
hex | 32e61a5ca |
13663053258 has 8 divisors (see below), whose sum is σ = 27326106528. Its totient is φ = 4554351084.
The previous prime is 13663053253. The next prime is 13663053329. The reversal of 13663053258 is 85235036631.
13663053258 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.
13663053258 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (13663053251) 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 3 ways as a sum of consecutive naturals, for example, 1138587766 + ... + 1138587777.
It is an arithmetic number, because the mean of its divisors is an integer number (3415763316).
Almost surely, 213663053258 is an apocalyptic number.
13663053258 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13663053258 is a wasteful number, since it uses less digits than its factorization.
13663053258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2277175548.
The product of its (nonzero) digits is 388800, while the sum is 42.
Adding to 13663053258 its reverse (85235036631), we get a palindrome (98898089889).
The spelling of 13663053258 in words is "thirteen billion, six hundred sixty-three million, fifty-three thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •