Base | Representation |
---|---|
bin | 10100100001010010011… |
… | …011100001100001111000 |
3 | 11222210210112112220101011 |
4 | 110201102123201201320 |
5 | 141100422322020044 |
6 | 2555450015203304 |
7 | 203610251050063 |
oct | 24412233414170 |
9 | 4883715486334 |
10 | 1410132220024 |
11 | 4a4040970150 |
12 | 1a9362516534 |
13 | a2c89b09438 |
14 | 4c3721498da |
15 | 26a32939134 |
hex | 148526e1878 |
1410132220024 has 32 divisors (see below), whose sum is σ = 2945730758400. Its totient is φ = 627331546720.
The previous prime is 1410132220009. The next prime is 1410132220033. The reversal of 1410132220024 is 4200222310141.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1410132219977 and 1410132220004.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 170466394 + ... + 170474665.
It is an arithmetic number, because the mean of its divisors is an integer number (92054086200).
Almost surely, 21410132220024 is an apocalyptic number.
It is an amenable number.
1410132220024 is an abundant number, since it is smaller than the sum of its proper divisors (1535598538376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1410132220024 is a wasteful number, since it uses less digits than its factorization.
1410132220024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340941123 (or 340941119 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 1410132220024 its reverse (4200222310141), we get a palindrome (5610354530165).
The spelling of 1410132220024 in words is "one trillion, four hundred ten billion, one hundred thirty-two million, two hundred twenty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •