Base | Representation |
---|---|
bin | 11000010001001100… |
… | …11101011000010110 |
3 | 1020122000202000021221 |
4 | 30020212131120112 |
5 | 203140433421210 |
6 | 5552513000554 |
7 | 640606246000 |
oct | 141046353026 |
9 | 36560660257 |
10 | 13029201430 |
11 | 558670a973 |
12 | 263755315a |
13 | 12c845735b |
14 | 8b85ab370 |
15 | 513cbe1da |
hex | 30899d616 |
13029201430 has 48 divisors (see below), whose sum is σ = 27363967200. Its totient is φ = 4464862752.
The previous prime is 13029201373. The next prime is 13029201433. The reversal of 13029201430 is 3410292031.
13029201430 is digitally balanced in base 5, 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 = 13029201395 and 13029201404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13029201433) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6684096 + ... + 6686044.
It is an arithmetic number, because the mean of its divisors is an integer number (570082650).
Almost surely, 213029201430 is an apocalyptic number.
13029201430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13029201430 is an abundant number, since it is smaller than the sum of its proper divisors (14334765770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13029201430 is an frugal number, since it uses more digits than its factorization.
13029201430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3926 (or 1963 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13029201430 its reverse (3410292031), we get a palindrome (16439493461).
The spelling of 13029201430 in words is "thirteen billion, twenty-nine million, two hundred one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •