Base | Representation |
---|---|
bin | 11010010101101111… |
… | …01100010100100010 |
3 | 1100111111211000020112 |
4 | 31022313230110202 |
5 | 212430044442310 |
6 | 10255111011322 |
7 | 1010266434641 |
oct | 151267542442 |
9 | 40444730215 |
10 | 14141015330 |
11 | 5aa7264132 |
12 | 28a7969b42 |
13 | 14448b33c0 |
14 | 982103358 |
15 | 57b6da705 |
hex | 34adec522 |
14141015330 has 128 divisors (see below), whose sum is σ = 28664326656. Its totient is φ = 4990003200.
The previous prime is 14141015323. The next prime is 14141015381. The reversal of 14141015330 is 3351014141.
It is a happy number.
14141015330 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 = 14141015296 and 14141015305.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 67018925 + ... + 67019135.
It is an arithmetic number, because the mean of its divisors is an integer number (223940052).
Almost surely, 214141015330 is an apocalyptic number.
14141015330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14141015330 is an abundant number, since it is smaller than the sum of its proper divisors (14523311326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14141015330 is a wasteful number, since it uses less digits than its factorization.
14141015330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 14141015330 its reverse (3351014141), we get a palindrome (17492029471).
The spelling of 14141015330 in words is "fourteen billion, one hundred forty-one million, fifteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •