Base | Representation |
---|---|
bin | 11010001000101010… |
… | …10010011101100100 |
3 | 1100012212102120200011 |
4 | 31010111102131210 |
5 | 212214010130340 |
6 | 10240152100004 |
7 | 1004465236012 |
oct | 150425223544 |
9 | 40185376604 |
10 | 14031333220 |
11 | 5a5035a363 |
12 | 2877094604 |
13 | 1427c5c948 |
14 | 9717118b2 |
15 | 571c720ea |
hex | 344552764 |
14031333220 has 24 divisors (see below), whose sum is σ = 29504551608. Its totient is φ = 5605152000.
The previous prime is 14031333209. The next prime is 14031333221. The reversal of 14031333220 is 2233313041.
It can be written as a sum of positive squares in 4 ways, for example, as 396567396 + 13634765824 = 19914^2 + 116768^2 .
It is a junction number, because it is equal to n+sod(n) for n = 14031333191 and 14031333200.
It is not an unprimeable number, because it can be changed into a prime (14031333221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 445731 + ... + 476170.
It is an arithmetic number, because the mean of its divisors is an integer number (1229356317).
Almost surely, 214031333220 is an apocalyptic number.
14031333220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14031333220 is an abundant number, since it is smaller than the sum of its proper divisors (15473218388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14031333220 is a wasteful number, since it uses less digits than its factorization.
14031333220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922671 (or 922669 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 14031333220 its reverse (2233313041), we get a palindrome (16264646261).
The spelling of 14031333220 in words is "fourteen billion, thirty-one million, three hundred thirty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •