Base | Representation |
---|---|
bin | 10100011001001100011… |
… | …010000010100110001101 |
3 | 11221222100211221000212201 |
4 | 110121030122002212031 |
5 | 140430122423431133 |
6 | 2551451353201501 |
7 | 203152006635253 |
oct | 24311432024615 |
9 | 4858324830781 |
10 | 1401441233293 |
11 | 4a039104a192 |
12 | 1a7737a00291 |
13 | a220339163a |
14 | 4bb89bb25d3 |
15 | 266c494bd7d |
hex | 1464c68298d |
1401441233293 has 8 divisors (see below), whose sum is σ = 1440055831040. Its totient is φ = 1362865467600.
The previous prime is 1401441233287. The next prime is 1401441233303. The reversal of 1401441233293 is 3923321441041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1401441233293 - 225 = 1401407678861 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401441233393) by changing a digit.
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, 9634833 + ... + 9779206.
It is an arithmetic number, because the mean of its divisors is an integer number (180006978880).
Almost surely, 21401441233293 is an apocalyptic number.
It is an amenable number.
1401441233293 is a deficient number, since it is larger than the sum of its proper divisors (38614597747).
1401441233293 is a wasteful number, since it uses less digits than its factorization.
1401441233293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19416027.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 1401441233293 in words is "one trillion, four hundred one billion, four hundred forty-one million, two hundred thirty-three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •