Base | Representation |
---|---|
bin | 110011101010… |
… | …000000110110 |
3 | 221110222100110 |
4 | 303222000312 |
5 | 11431311210 |
6 | 1202123450 |
7 | 223046250 |
oct | 63520066 |
9 | 27428313 |
10 | 13541430 |
11 | 7709971 |
12 | 4650586 |
13 | 2a617a6 |
14 | 1b26cd0 |
15 | 12c7420 |
hex | cea036 |
13541430 has 32 divisors (see below), whose sum is σ = 37142784. Its totient is φ = 3095136.
The previous prime is 13541419. The next prime is 13541441. The reversal of 13541430 is 3414531.
It is an interprime number because it is at equal distance from previous prime (13541419) and next prime (13541441).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 13541397 and 13541406.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32032 + ... + 32451.
It is an arithmetic number, because the mean of its divisors is an integer number (1160712).
Almost surely, 213541430 is an apocalyptic number.
13541430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13541430 is an abundant number, since it is smaller than the sum of its proper divisors (23601354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13541430 is a wasteful number, since it uses less digits than its factorization.
13541430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64500.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 13541430 is about 3679.8682041617. The cubic root of 13541430 is about 238.3534869206.
Adding to 13541430 its reverse (3414531), we get a palindrome (16955961).
The spelling of 13541430 in words is "thirteen million, five hundred forty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •