Base | Representation |
---|---|
bin | 10100011000111000111… |
… | …010001000100111010000 |
3 | 11221221112001101001102012 |
4 | 110120320322020213100 |
5 | 140423440202232344 |
6 | 2551355105442052 |
7 | 203140625236334 |
oct | 24307072104720 |
9 | 4857461331365 |
10 | 1401114102224 |
11 | 4a0233424831 |
12 | 1a7666340328 |
13 | a2180684665 |
14 | 4bb585797c4 |
15 | 266a5d7e29e |
hex | 14638e889d0 |
1401114102224 has 20 divisors (see below), whose sum is σ = 2802228205440. Its totient is φ = 677958436320.
The previous prime is 1401114102187. The next prime is 1401114102239. The reversal of 1401114102224 is 4222014111041.
1401114102224 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 1401114102224.
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 3 ways as a sum of consecutive naturals, for example, 1412412914 + ... + 1412413905.
It is an arithmetic number, because the mean of its divisors is an integer number (140111410272).
Almost surely, 21401114102224 is an apocalyptic number.
It is an amenable number.
1401114102224 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1401114102224 is a wasteful number, since it uses less digits than its factorization.
1401114102224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2824826858 (or 2824826852 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 1401114102224 its reverse (4222014111041), we get a palindrome (5623128213265).
The spelling of 1401114102224 in words is "one trillion, four hundred one billion, one hundred fourteen million, one hundred two thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •