Base | Representation |
---|---|
bin | 11000010010100001… |
… | …11111100001110110 |
3 | 1020122210201111002221 |
4 | 30021100333201312 |
5 | 203201312220400 |
6 | 5553551552554 |
7 | 641103105025 |
oct | 141120774166 |
9 | 36583644087 |
10 | 13040351350 |
11 | 5591a35a84 |
12 | 263b22b75a |
13 | 12ca85c440 |
14 | 8b9c708bc |
15 | 514c72c1a |
hex | 30943f876 |
13040351350 has 96 divisors (see below), whose sum is σ = 27128513664. Its totient is φ = 4632422400.
The previous prime is 13040351333. The next prime is 13040351371. The reversal of 13040351350 is 5315304031.
13040351350 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 1942099 + ... + 1948801.
It is an arithmetic number, because the mean of its divisors is an integer number (282588684).
Almost surely, 213040351350 is an apocalyptic number.
13040351350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13040351350 is an abundant number, since it is smaller than the sum of its proper divisors (14088162314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13040351350 is a wasteful number, since it uses less digits than its factorization.
13040351350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6842 (or 6837 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 13040351350 its reverse (5315304031), we get a palindrome (18355655381).
The spelling of 13040351350 in words is "thirteen billion, forty million, three hundred fifty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •