Base | Representation |
---|---|
bin | 11000010100100001… |
… | …11001011111010110 |
3 | 1020200222020121012011 |
4 | 30022100321133112 |
5 | 203220104310310 |
6 | 5555351014434 |
7 | 641365360051 |
oct | 141220713726 |
9 | 36628217164 |
10 | 13057103830 |
11 | 55a0438401 |
12 | 264496a41a |
13 | 1301176654 |
14 | 8bc191a98 |
15 | 51648178a |
hex | 30a4397d6 |
13057103830 has 32 divisors (see below), whose sum is σ = 23574240000. Its totient is φ = 5206991712.
The previous prime is 13057103819. The next prime is 13057103833. The reversal of 13057103830 is 3830175031.
It is a happy number.
13057103830 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 = 13057103792 and 13057103801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13057103833) 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 15 ways as a sum of consecutive naturals, for example, 7684321 + ... + 7686019.
It is an arithmetic number, because the mean of its divisors is an integer number (736695000).
Almost surely, 213057103830 is an apocalyptic number.
13057103830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13057103830 is a deficient number, since it is larger than the sum of its proper divisors (10517136170).
13057103830 is a wasteful number, since it uses less digits than its factorization.
13057103830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 13057103830 its reverse (3830175031), we get a palindrome (16887278861).
The spelling of 13057103830 in words is "thirteen billion, fifty-seven million, one hundred three thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •