Base | Representation |
---|---|
bin | 10011101001100000001… |
… | …110010110011000111100 |
3 | 11210002012010200102002112 |
4 | 103221200032112120330 |
5 | 134110234412333104 |
6 | 2512142230513152 |
7 | 166360026346232 |
oct | 23514016263074 |
9 | 4702163612075 |
10 | 1350234105404 |
11 | 4806a3a52088 |
12 | 1998268057b8 |
13 | 9a432502c72 |
14 | 494cd018952 |
15 | 251c910e86e |
hex | 13a6039663c |
1350234105404 has 96 divisors (see below), whose sum is σ = 2751298099200. Its totient is φ = 575523809280.
The previous prime is 1350234105403. The next prime is 1350234105427. The reversal of 1350234105404 is 4045014320531.
It is a super-2 number, since 2×13502341054042 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350234105403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3121232 + ... + 3527400.
It is an arithmetic number, because the mean of its divisors is an integer number (28659355200).
Almost surely, 21350234105404 is an apocalyptic number.
It is an amenable number.
1350234105404 is an abundant number, since it is smaller than the sum of its proper divisors (1401063993796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350234105404 is a wasteful number, since it uses less digits than its factorization.
1350234105404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406323 (or 406321 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 1350234105404 its reverse (4045014320531), we get a palindrome (5395248425935).
The spelling of 1350234105404 in words is "one trillion, three hundred fifty billion, two hundred thirty-four million, one hundred five thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •