Base | Representation |
---|---|
bin | 10100100010011010100… |
… | …000010000011100101010 |
3 | 11222220220210212122100200 |
4 | 110202122200100130222 |
5 | 141110411400422310 |
6 | 3000210012413030 |
7 | 203652233064312 |
oct | 24423240203452 |
9 | 4886823778320 |
10 | 1411341420330 |
11 | 4a4601490246 |
12 | 1a963b477176 |
13 | a31204a248a |
14 | 4c448992442 |
15 | 26aa3b909c0 |
hex | 1489a81072a |
1411341420330 has 48 divisors (see below), whose sum is σ = 3715936922880. Its totient is φ = 371593688544.
The previous prime is 1411341420301. The next prime is 1411341420343. The reversal of 1411341420330 is 330241431141.
1411341420330 is a `hidden beast` number, since 1 + 4 + 1 + 13 + 414 + 203 + 30 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1411341420294 and 1411341420303.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 99243342 + ... + 99257561.
It is an arithmetic number, because the mean of its divisors is an integer number (77415352560).
Almost surely, 21411341420330 is an apocalyptic number.
1411341420330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1411341420330 is an abundant number, since it is smaller than the sum of its proper divisors (2304595502550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1411341420330 is a wasteful number, since it uses less digits than its factorization.
1411341420330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198500995 (or 198500992 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1411341420330 its reverse (330241431141), we get a palindrome (1741582851471).
The spelling of 1411341420330 in words is "one trillion, four hundred eleven billion, three hundred forty-one million, four hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •