Base | Representation |
---|---|
bin | 11000101000010101… |
… | …11110010110010110 |
3 | 1021010120000102001211 |
4 | 30110022332112112 |
5 | 204040132314110 |
6 | 10024045412034 |
7 | 645454251121 |
oct | 142412762626 |
9 | 37116012054 |
10 | 13223323030 |
11 | 5676248345 |
12 | 269056a01a |
13 | 1329733ac8 |
14 | 8d629d3b8 |
15 | 525d6698a |
hex | 3142be596 |
13223323030 has 32 divisors (see below), whose sum is σ = 25089442560. Its totient is φ = 5003998560.
The previous prime is 13223323013. The next prime is 13223323037. The reversal of 13223323030 is 3032332231.
13223323030 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 = 13223322992 and 13223323010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13223323037) 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, 90265 + ... + 185995.
It is an arithmetic number, because the mean of its divisors is an integer number (784045080).
Almost surely, 213223323030 is an apocalyptic number.
13223323030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13223323030 is a deficient number, since it is larger than the sum of its proper divisors (11866119530).
13223323030 is a wasteful number, since it uses less digits than its factorization.
13223323030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96484.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 13223323030 its reverse (3032332231), we get a palindrome (16255655261).
The spelling of 13223323030 in words is "thirteen billion, two hundred twenty-three million, three hundred twenty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •