Base | Representation |
---|---|
bin | 11000110001100110… |
… | …11100110011110100 |
3 | 1021022222020222000202 |
4 | 30120303130303310 |
5 | 204220031324140 |
6 | 10035503300032 |
7 | 650416665221 |
oct | 143063346364 |
9 | 37288228022 |
10 | 13301042420 |
11 | 5706101046 |
12 | 26b25aa618 |
13 | 133c876103 |
14 | 902730948 |
15 | 52cab9915 |
hex | 318cdccf4 |
13301042420 has 48 divisors (see below), whose sum is σ = 29837073168. Its totient is φ = 4963123200.
The previous prime is 13301042413. The next prime is 13301042431. The reversal of 13301042420 is 2424010331.
It can be written as a sum of positive squares in 8 ways, for example, as 8797156 + 13292245264 = 2966^2 + 115292^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13301042392 and 13301042401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 134681 + ... + 211520.
It is an arithmetic number, because the mean of its divisors is an integer number (621605691).
Almost surely, 213301042420 is an apocalyptic number.
13301042420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13301042420 is an abundant number, since it is smaller than the sum of its proper divisors (16536030748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301042420 is a wasteful number, since it uses less digits than its factorization.
13301042420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346340 (or 346338 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 13301042420 its reverse (2424010331), we get a palindrome (15725052751).
The spelling of 13301042420 in words is "thirteen billion, three hundred one million, forty-two thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •