Base | Representation |
---|---|
bin | 10100100100010000100… |
… | …000001001000001100100 |
3 | 12000010000202222212021020 |
4 | 110210100200021001210 |
5 | 141123440200221122 |
6 | 3001134252051140 |
7 | 204052262101263 |
oct | 24442040110144 |
9 | 5003022885236 |
10 | 1413321101412 |
11 | 4a5427a09a10 |
12 | 1a9ab2463ab0 |
13 | a33776841bc |
14 | 4c59587c5da |
15 | 26b6c88cc5c |
hex | 14910809064 |
1413321101412 has 48 divisors (see below), whose sum is σ = 3623426284800. Its totient is φ = 425197971360.
The previous prime is 1413321101389. The next prime is 1413321101417. The reversal of 1413321101412 is 2141011233141.
It is not an unprimeable number, because it can be changed into a prime (1413321101417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38495962 + ... + 38532657.
It is an arithmetic number, because the mean of its divisors is an integer number (75488047600).
Almost surely, 21413321101412 is an apocalyptic number.
1413321101412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1413321101412 is an abundant number, since it is smaller than the sum of its proper divisors (2210105183388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1413321101412 is a wasteful number, since it uses less digits than its factorization.
1413321101412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77028776 (or 77028774 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 1413321101412 its reverse (2141011233141), we get a palindrome (3554332334553).
The spelling of 1413321101412 in words is "one trillion, four hundred thirteen billion, three hundred twenty-one million, one hundred one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •