Base | Representation |
---|---|
bin | 11001001000001111… |
… | …01100101001011110 |
3 | 1021211012111201001022 |
4 | 30210013230221132 |
5 | 210112132241200 |
6 | 10110404444142 |
7 | 655213516442 |
oct | 144407545136 |
9 | 37735451038 |
10 | 13490899550 |
11 | 57a3296567 |
12 | 27460a9652 |
13 | 136ccbb7cb |
14 | 91da32822 |
15 | 53e5bd885 |
hex | 3241eca5e |
13490899550 has 96 divisors (see below), whose sum is σ = 26987558400. Its totient is φ = 5005123200.
The previous prime is 13490899523. The next prime is 13490899553. The reversal of 13490899550 is 5599809431.
It is a happy number.
13490899550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13490899492 and 13490899501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13490899553) 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 47 ways as a sum of consecutive naturals, for example, 7367135 + ... + 7368965.
It is an arithmetic number, because the mean of its divisors is an integer number (281120400).
Almost surely, 213490899550 is an apocalyptic number.
13490899550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13490899550 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
13490899550 is a wasteful number, since it uses less digits than its factorization.
13490899550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2058 (or 2053 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 53.
The spelling of 13490899550 in words is "thirteen billion, four hundred ninety million, eight hundred ninety-nine thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •